16.82/7.89 NO 16.82/7.89 16.82/7.89 Ultimate: Cannot open display: 16.82/7.89 This is Ultimate 0.1.24-8dc7c08-m 16.82/7.89 [2019-03-29 02:00:58,742 INFO L170 SettingsManager]: Resetting all preferences to default values... 16.82/7.89 [2019-03-29 02:00:58,744 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 16.82/7.89 [2019-03-29 02:00:58,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 16.82/7.89 [2019-03-29 02:00:58,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 16.82/7.89 [2019-03-29 02:00:58,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 16.82/7.89 [2019-03-29 02:00:58,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 16.82/7.89 [2019-03-29 02:00:58,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 16.82/7.89 [2019-03-29 02:00:58,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 16.82/7.89 [2019-03-29 02:00:58,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 16.82/7.89 [2019-03-29 02:00:58,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 16.82/7.89 [2019-03-29 02:00:58,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 16.82/7.89 [2019-03-29 02:00:58,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 16.82/7.89 [2019-03-29 02:00:58,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 16.82/7.89 [2019-03-29 02:00:58,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 16.82/7.89 [2019-03-29 02:00:58,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 16.82/7.89 [2019-03-29 02:00:58,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 16.82/7.89 [2019-03-29 02:00:58,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 16.82/7.89 [2019-03-29 02:00:58,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 16.82/7.89 [2019-03-29 02:00:58,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 16.82/7.89 [2019-03-29 02:00:58,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 16.82/7.89 [2019-03-29 02:00:58,778 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 16.82/7.89 [2019-03-29 02:00:58,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 16.82/7.89 [2019-03-29 02:00:58,780 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,780 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 16.82/7.89 [2019-03-29 02:00:58,781 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 16.82/7.89 [2019-03-29 02:00:58,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 16.82/7.89 [2019-03-29 02:00:58,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 16.82/7.89 [2019-03-29 02:00:58,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 16.82/7.89 [2019-03-29 02:00:58,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 16.82/7.89 [2019-03-29 02:00:58,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 16.82/7.89 [2019-03-29 02:00:58,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 16.82/7.89 [2019-03-29 02:00:58,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 16.82/7.89 [2019-03-29 02:00:58,786 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 16.82/7.89 [2019-03-29 02:00:58,801 INFO L110 SettingsManager]: Loading preferences was successful 16.82/7.89 [2019-03-29 02:00:58,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 16.82/7.89 [2019-03-29 02:00:58,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 16.82/7.89 [2019-03-29 02:00:58,803 INFO L133 SettingsManager]: * Rewrite not-equals=true 16.82/7.89 [2019-03-29 02:00:58,803 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 16.82/7.89 [2019-03-29 02:00:58,803 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 16.82/7.89 [2019-03-29 02:00:58,803 INFO L133 SettingsManager]: * Use SBE=true 16.82/7.89 [2019-03-29 02:00:58,804 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 16.82/7.89 [2019-03-29 02:00:58,804 INFO L133 SettingsManager]: * Use old map elimination=false 16.82/7.89 [2019-03-29 02:00:58,804 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 16.82/7.89 [2019-03-29 02:00:58,804 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 16.82/7.89 [2019-03-29 02:00:58,804 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 16.82/7.89 [2019-03-29 02:00:58,804 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 16.82/7.89 [2019-03-29 02:00:58,805 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 16.82/7.89 [2019-03-29 02:00:58,805 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:00:58,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 16.82/7.89 [2019-03-29 02:00:58,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 16.82/7.89 [2019-03-29 02:00:58,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE 16.82/7.89 [2019-03-29 02:00:58,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 16.82/7.89 [2019-03-29 02:00:58,806 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 16.82/7.89 [2019-03-29 02:00:58,806 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 16.82/7.89 [2019-03-29 02:00:58,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 16.82/7.89 [2019-03-29 02:00:58,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 16.82/7.89 [2019-03-29 02:00:58,806 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 16.82/7.89 [2019-03-29 02:00:58,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.82/7.89 [2019-03-29 02:00:58,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 16.82/7.89 [2019-03-29 02:00:58,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 16.82/7.89 [2019-03-29 02:00:58,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 16.82/7.89 [2019-03-29 02:00:58,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 16.82/7.89 [2019-03-29 02:00:58,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 16.82/7.89 [2019-03-29 02:00:58,846 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 16.82/7.89 [2019-03-29 02:00:58,850 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 16.82/7.89 [2019-03-29 02:00:58,852 INFO L271 PluginConnector]: Initializing CDTParser... 16.82/7.89 [2019-03-29 02:00:58,852 INFO L276 PluginConnector]: CDTParser initialized 16.82/7.89 [2019-03-29 02:00:58,853 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 16.82/7.89 [2019-03-29 02:00:58,912 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a5c0e1173494429faa90a0bc515272be/FLAGddeb2c0b7 16.82/7.89 [2019-03-29 02:00:59,267 INFO L307 CDTParser]: Found 1 translation units. 16.82/7.89 [2019-03-29 02:00:59,268 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 16.82/7.89 [2019-03-29 02:00:59,275 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a5c0e1173494429faa90a0bc515272be/FLAGddeb2c0b7 16.82/7.89 [2019-03-29 02:00:59,672 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a5c0e1173494429faa90a0bc515272be 16.82/7.89 [2019-03-29 02:00:59,683 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 16.82/7.89 [2019-03-29 02:00:59,685 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 16.82/7.89 [2019-03-29 02:00:59,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 16.82/7.89 [2019-03-29 02:00:59,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 16.82/7.89 [2019-03-29 02:00:59,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 16.82/7.89 [2019-03-29 02:00:59,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:00:59,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e87853b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59, skipping insertion in model container 16.82/7.89 [2019-03-29 02:00:59,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:00:59,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 16.82/7.89 [2019-03-29 02:00:59,720 INFO L176 MainTranslator]: Built tables and reachable declarations 16.82/7.89 [2019-03-29 02:00:59,878 INFO L206 PostProcessor]: Analyzing one entry point: main 16.82/7.89 [2019-03-29 02:00:59,883 INFO L191 MainTranslator]: Completed pre-run 16.82/7.89 [2019-03-29 02:00:59,903 INFO L206 PostProcessor]: Analyzing one entry point: main 16.82/7.89 [2019-03-29 02:00:59,918 INFO L195 MainTranslator]: Completed translation 16.82/7.89 [2019-03-29 02:00:59,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59 WrapperNode 16.82/7.89 [2019-03-29 02:00:59,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 16.82/7.89 [2019-03-29 02:00:59,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 16.82/7.89 [2019-03-29 02:00:59,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 16.82/7.89 [2019-03-29 02:00:59,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 16.82/7.89 [2019-03-29 02:00:59,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:00:59,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 16.82/7.89 [2019-03-29 02:01:00,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 16.82/7.89 [2019-03-29 02:01:00,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 16.82/7.89 [2019-03-29 02:01:00,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized 16.82/7.89 [2019-03-29 02:01:00,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 16.82/7.89 [2019-03-29 02:01:00,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 16.82/7.89 [2019-03-29 02:01:00,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... 16.82/7.89 [2019-03-29 02:01:00,034 INFO L276 PluginConnector]: RCFGBuilder initialized 16.82/7.89 [2019-03-29 02:01:00,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (1/1) ... 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.82/7.89 [2019-03-29 02:01:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 16.82/7.89 [2019-03-29 02:01:00,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 16.82/7.89 [2019-03-29 02:01:00,245 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 16.82/7.89 [2019-03-29 02:01:00,245 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 16.82/7.89 [2019-03-29 02:01:00,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:00 BoogieIcfgContainer 16.82/7.89 [2019-03-29 02:01:00,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 16.82/7.89 [2019-03-29 02:01:00,247 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 16.82/7.89 [2019-03-29 02:01:00,247 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 16.82/7.89 [2019-03-29 02:01:00,250 INFO L276 PluginConnector]: BlockEncodingV2 initialized 16.82/7.89 [2019-03-29 02:01:00,251 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:00" (1/1) ... 16.82/7.89 [2019-03-29 02:01:00,267 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 23 edges 16.82/7.89 [2019-03-29 02:01:00,269 INFO L258 BlockEncoder]: Using Remove infeasible edges 16.82/7.89 [2019-03-29 02:01:00,270 INFO L263 BlockEncoder]: Using Maximize final states 16.82/7.89 [2019-03-29 02:01:00,270 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 16.82/7.89 [2019-03-29 02:01:00,271 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 16.82/7.89 [2019-03-29 02:01:00,272 INFO L296 BlockEncoder]: Using Remove sink states 16.82/7.89 [2019-03-29 02:01:00,273 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 16.82/7.89 [2019-03-29 02:01:00,274 INFO L179 BlockEncoder]: Using Rewrite not-equals 16.82/7.89 [2019-03-29 02:01:00,290 INFO L185 BlockEncoder]: Using Use SBE 16.82/7.89 [2019-03-29 02:01:00,298 INFO L200 BlockEncoder]: SBE split 0 edges 16.82/7.89 [2019-03-29 02:01:00,304 INFO L70 emoveInfeasibleEdges]: Removed 5 edges and 0 locations because of local infeasibility 16.82/7.89 [2019-03-29 02:01:00,305 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.82/7.89 [2019-03-29 02:01:00,329 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 16.82/7.89 [2019-03-29 02:01:00,331 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 16.82/7.89 [2019-03-29 02:01:00,333 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 16.82/7.89 [2019-03-29 02:01:00,333 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.82/7.89 [2019-03-29 02:01:00,333 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 16.82/7.89 [2019-03-29 02:01:00,334 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 16.82/7.89 [2019-03-29 02:01:00,334 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 10 edges 16.82/7.89 [2019-03-29 02:01:00,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:00 BasicIcfg 16.82/7.89 [2019-03-29 02:01:00,335 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 16.82/7.89 [2019-03-29 02:01:00,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 16.82/7.89 [2019-03-29 02:01:00,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... 16.82/7.89 [2019-03-29 02:01:00,340 INFO L276 PluginConnector]: TraceAbstraction initialized 16.82/7.89 [2019-03-29 02:01:00,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 02:00:59" (1/4) ... 16.82/7.89 [2019-03-29 02:01:00,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (2/4) ... 16.82/7.89 [2019-03-29 02:01:00,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:00" (3/4) ... 16.82/7.89 [2019-03-29 02:01:00,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:00" (4/4) ... 16.82/7.89 [2019-03-29 02:01:00,344 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 16.82/7.89 [2019-03-29 02:01:00,357 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 16.82/7.89 [2019-03-29 02:01:00,365 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 16.82/7.89 [2019-03-29 02:01:00,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 16.82/7.89 [2019-03-29 02:01:00,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation 16.82/7.89 [2019-03-29 02:01:00,412 INFO L382 AbstractCegarLoop]: Interprodecural is true 16.82/7.89 [2019-03-29 02:01:00,412 INFO L383 AbstractCegarLoop]: Hoare is true 16.82/7.89 [2019-03-29 02:01:00,412 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 16.82/7.89 [2019-03-29 02:01:00,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 16.82/7.89 [2019-03-29 02:01:00,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 16.82/7.89 [2019-03-29 02:01:00,413 INFO L387 AbstractCegarLoop]: Difference is false 16.82/7.89 [2019-03-29 02:01:00,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 16.82/7.89 [2019-03-29 02:01:00,414 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 16.82/7.89 [2019-03-29 02:01:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 16.82/7.89 [2019-03-29 02:01:00,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 16.82/7.89 [2019-03-29 02:01:00,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 16.82/7.89 [2019-03-29 02:01:00,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 16.82/7.89 [2019-03-29 02:01:00,498 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 27) the Hoare annotation is: true 16.82/7.89 [2019-03-29 02:01:00,498 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 23 29) the Hoare annotation is: true 16.82/7.89 [2019-03-29 02:01:00,499 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 31) the Hoare annotation is: true 16.82/7.89 [2019-03-29 02:01:00,499 INFO L451 ceAbstractionStarter]: At program point L18-2(lines 18 33) the Hoare annotation is: true 16.82/7.89 [2019-03-29 02:01:00,499 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 15 35) the Hoare annotation is: true 16.82/7.89 [2019-03-29 02:01:00,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:00 BasicIcfg 16.82/7.89 [2019-03-29 02:01:00,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 16.82/7.89 [2019-03-29 02:01:00,509 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 16.82/7.89 [2019-03-29 02:01:00,509 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 16.82/7.89 [2019-03-29 02:01:00,512 INFO L276 PluginConnector]: BuchiAutomizer initialized 16.82/7.89 [2019-03-29 02:01:00,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.82/7.89 [2019-03-29 02:01:00,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 02:00:59" (1/5) ... 16.82/7.89 [2019-03-29 02:01:00,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129de3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.82/7.89 [2019-03-29 02:01:00,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:00:59" (2/5) ... 16.82/7.89 [2019-03-29 02:01:00,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129de3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.82/7.89 [2019-03-29 02:01:00,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:00" (3/5) ... 16.82/7.89 [2019-03-29 02:01:00,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129de3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.82/7.89 [2019-03-29 02:01:00,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:00" (4/5) ... 16.82/7.89 [2019-03-29 02:01:00,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129de3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:00, skipping insertion in model container 16.82/7.89 [2019-03-29 02:01:00,516 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.82/7.89 [2019-03-29 02:01:00,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:00" (5/5) ... 16.82/7.89 [2019-03-29 02:01:00,518 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 16.82/7.89 [2019-03-29 02:01:00,546 INFO L133 ementStrategyFactory]: Using default assertion order modulation 16.82/7.89 [2019-03-29 02:01:00,546 INFO L374 BuchiCegarLoop]: Interprodecural is true 16.82/7.89 [2019-03-29 02:01:00,546 INFO L375 BuchiCegarLoop]: Hoare is true 16.82/7.89 [2019-03-29 02:01:00,546 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 16.82/7.89 [2019-03-29 02:01:00,547 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 16.82/7.89 [2019-03-29 02:01:00,547 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 16.82/7.89 [2019-03-29 02:01:00,547 INFO L379 BuchiCegarLoop]: Difference is false 16.82/7.89 [2019-03-29 02:01:00,547 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 16.82/7.89 [2019-03-29 02:01:00,547 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 16.82/7.89 [2019-03-29 02:01:00,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 16.82/7.89 [2019-03-29 02:01:00,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 16.82/7.89 [2019-03-29 02:01:00,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:00,568 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:00,574 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:00,574 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.82/7.89 [2019-03-29 02:01:00,574 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 16.82/7.89 [2019-03-29 02:01:00,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 16.82/7.89 [2019-03-29 02:01:00,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 16.82/7.89 [2019-03-29 02:01:00,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:00,575 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:00,575 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:00,576 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.82/7.89 [2019-03-29 02:01:00,581 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 8#L15-2true 16.82/7.89 [2019-03-29 02:01:00,581 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 5#L18-2true [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 8#L15-2true 16.82/7.89 [2019-03-29 02:01:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:00,588 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:00,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:00,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 3881, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:00,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:00,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 112474, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:00,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:00,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.82/7.89 [2019-03-29 02:01:00,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 16.82/7.89 [2019-03-29 02:01:00,786 INFO L216 LassoAnalysis]: Preferences: 16.82/7.89 [2019-03-29 02:01:00,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.82/7.89 [2019-03-29 02:01:00,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.82/7.89 [2019-03-29 02:01:00,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.82/7.89 [2019-03-29 02:01:00,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.82/7.89 [2019-03-29 02:01:00,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:00,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.82/7.89 [2019-03-29 02:01:00,789 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.82/7.89 [2019-03-29 02:01:00,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 16.82/7.89 [2019-03-29 02:01:00,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.82/7.89 [2019-03-29 02:01:00,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.82/7.89 [2019-03-29 02:01:00,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:00,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:00,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:00,911 INFO L300 LassoAnalysis]: Preprocessing complete. 16.82/7.89 [2019-03-29 02:01:00,912 INFO L412 LassoAnalysis]: Checking for nontermination... 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:00,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.82/7.89 [2019-03-29 02:01:00,919 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.82/7.89 [2019-03-29 02:01:00,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.82/7.89 [2019-03-29 02:01:00,953 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:00,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.82/7.89 [2019-03-29 02:01:00,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.82/7.89 [2019-03-29 02:01:00,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.82/7.89 [2019-03-29 02:01:00,987 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:00,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.82/7.89 [2019-03-29 02:01:00,993 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:01,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.82/7.89 [2019-03-29 02:01:01,029 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.82/7.89 [2019-03-29 02:01:01,469 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.82/7.89 [2019-03-29 02:01:01,471 INFO L216 LassoAnalysis]: Preferences: 16.82/7.89 [2019-03-29 02:01:01,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.82/7.89 [2019-03-29 02:01:01,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.82/7.89 [2019-03-29 02:01:01,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.82/7.89 [2019-03-29 02:01:01,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.82/7.89 [2019-03-29 02:01:01,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.82/7.89 [2019-03-29 02:01:01,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.82/7.89 [2019-03-29 02:01:01,473 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.82/7.89 [2019-03-29 02:01:01,473 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 16.82/7.89 [2019-03-29 02:01:01,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.82/7.89 [2019-03-29 02:01:01,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.82/7.89 [2019-03-29 02:01:01,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:01,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:01,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.82/7.89 [2019-03-29 02:01:01,556 INFO L300 LassoAnalysis]: Preprocessing complete. 16.82/7.89 [2019-03-29 02:01:01,562 INFO L497 LassoAnalysis]: Using template 'affine'. 16.82/7.89 [2019-03-29 02:01:01,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.82/7.89 Termination analysis: LINEAR_WITH_GUESSES 16.82/7.89 Number of strict supporting invariants: 0 16.82/7.89 Number of non-strict supporting invariants: 1 16.82/7.89 Consider only non-deceasing supporting invariants: true 16.82/7.89 Simplify termination arguments: true 16.82/7.89 Simplify supporting invariants: trueOverapproximate stem: false 16.82/7.89 [2019-03-29 02:01:01,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.82/7.89 [2019-03-29 02:01:01,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.82/7.89 [2019-03-29 02:01:01,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.82/7.89 [2019-03-29 02:01:01,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.82/7.89 [2019-03-29 02:01:01,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 16.82/7.89 [2019-03-29 02:01:01,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 16.82/7.89 [2019-03-29 02:01:01,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.82/7.89 [2019-03-29 02:01:01,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.82/7.89 Termination analysis: LINEAR_WITH_GUESSES 16.82/7.89 Number of strict supporting invariants: 0 16.82/7.89 Number of non-strict supporting invariants: 1 16.82/7.89 Consider only non-deceasing supporting invariants: true 16.82/7.89 Simplify termination arguments: true 16.82/7.89 Simplify supporting invariants: trueOverapproximate stem: false 16.82/7.89 [2019-03-29 02:01:01,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.82/7.89 [2019-03-29 02:01:01,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.82/7.89 [2019-03-29 02:01:01,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.82/7.89 [2019-03-29 02:01:01,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.82/7.89 [2019-03-29 02:01:01,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 16.82/7.89 [2019-03-29 02:01:01,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 16.82/7.89 [2019-03-29 02:01:01,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.82/7.89 [2019-03-29 02:01:01,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.82/7.89 Termination analysis: LINEAR_WITH_GUESSES 16.82/7.89 Number of strict supporting invariants: 0 16.82/7.89 Number of non-strict supporting invariants: 1 16.82/7.89 Consider only non-deceasing supporting invariants: true 16.82/7.89 Simplify termination arguments: true 16.82/7.89 Simplify supporting invariants: trueOverapproximate stem: false 16.82/7.89 [2019-03-29 02:01:01,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.82/7.89 [2019-03-29 02:01:01,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.82/7.89 [2019-03-29 02:01:01,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.82/7.89 [2019-03-29 02:01:01,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.82/7.89 [2019-03-29 02:01:01,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.82/7.89 [2019-03-29 02:01:01,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.82/7.89 [2019-03-29 02:01:01,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.82/7.89 [2019-03-29 02:01:01,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.82/7.89 [2019-03-29 02:01:01,609 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.82/7.89 [2019-03-29 02:01:01,610 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 16.82/7.89 [2019-03-29 02:01:01,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.82/7.89 [2019-03-29 02:01:01,612 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.82/7.89 [2019-03-29 02:01:01,613 INFO L518 LassoAnalysis]: Proved termination. 16.82/7.89 [2019-03-29 02:01:01,613 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.82/7.89 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 16.82/7.89 Supporting invariants [] 16.82/7.89 [2019-03-29 02:01:01,615 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.82/7.89 [2019-03-29 02:01:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:01,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core 16.82/7.89 [2019-03-29 02:01:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.82/7.89 [2019-03-29 02:01:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:01,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core 16.82/7.89 [2019-03-29 02:01:01,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.82/7.89 [2019-03-29 02:01:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:01,706 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 16.82/7.89 [2019-03-29 02:01:01,711 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 16.82/7.89 [2019-03-29 02:01:01,713 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. 16.82/7.89 [2019-03-29 02:01:01,832 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 39 transitions. Complement of second has 9 states. 16.82/7.89 [2019-03-29 02:01:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 16.82/7.89 [2019-03-29 02:01:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 16.82/7.89 [2019-03-29 02:01:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:01,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 2 letters. 16.82/7.89 [2019-03-29 02:01:01,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.82/7.89 [2019-03-29 02:01:01,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. 16.82/7.89 [2019-03-29 02:01:01,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.82/7.89 [2019-03-29 02:01:01,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 4 letters. 16.82/7.89 [2019-03-29 02:01:01,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.82/7.89 [2019-03-29 02:01:01,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 39 transitions. 16.82/7.89 [2019-03-29 02:01:01,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 16.82/7.89 [2019-03-29 02:01:01,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 39 transitions. 16.82/7.89 [2019-03-29 02:01:01,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 16.82/7.89 [2019-03-29 02:01:01,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 16.82/7.89 [2019-03-29 02:01:01,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 39 transitions. 16.82/7.89 [2019-03-29 02:01:01,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 16.82/7.89 [2019-03-29 02:01:01,857 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 39 transitions. 16.82/7.89 [2019-03-29 02:01:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 39 transitions. 16.82/7.89 [2019-03-29 02:01:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. 16.82/7.89 [2019-03-29 02:01:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 16.82/7.89 [2019-03-29 02:01:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. 16.82/7.89 [2019-03-29 02:01:01,888 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 26 transitions. 16.82/7.89 [2019-03-29 02:01:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 16.82/7.89 [2019-03-29 02:01:01,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 16.82/7.89 [2019-03-29 02:01:01,892 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand 4 states. 16.82/7.89 [2019-03-29 02:01:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.82/7.89 [2019-03-29 02:01:01,929 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. 16.82/7.89 [2019-03-29 02:01:01,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 16.82/7.89 [2019-03-29 02:01:01,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 35 transitions. 16.82/7.89 [2019-03-29 02:01:01,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 16.82/7.89 [2019-03-29 02:01:01,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 11 states and 18 transitions. 16.82/7.89 [2019-03-29 02:01:01,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 16.82/7.89 [2019-03-29 02:01:01,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 16.82/7.89 [2019-03-29 02:01:01,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. 16.82/7.89 [2019-03-29 02:01:01,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.82/7.89 [2019-03-29 02:01:01,936 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. 16.82/7.89 [2019-03-29 02:01:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. 16.82/7.89 [2019-03-29 02:01:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. 16.82/7.89 [2019-03-29 02:01:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 16.82/7.89 [2019-03-29 02:01:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. 16.82/7.89 [2019-03-29 02:01:01,938 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. 16.82/7.89 [2019-03-29 02:01:01,938 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. 16.82/7.89 [2019-03-29 02:01:01,938 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 16.82/7.89 [2019-03-29 02:01:01,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 11 transitions. 16.82/7.89 [2019-03-29 02:01:01,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 16.82/7.89 [2019-03-29 02:01:01,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:01,939 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:01,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:01,940 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 16.82/7.89 [2019-03-29 02:01:01,940 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 119#L15-2 16.82/7.89 [2019-03-29 02:01:01,940 INFO L796 eck$LassoCheckResult]: Loop: 119#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 117#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 116#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 120#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 119#L15-2 16.82/7.89 [2019-03-29 02:01:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 2 times 16.82/7.89 [2019-03-29 02:01:01,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:01,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:01,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash 3708846, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:01,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:01,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:01,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.82/7.89 [2019-03-29 02:01:01,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 16.82/7.89 [2019-03-29 02:01:01,982 INFO L811 eck$LassoCheckResult]: loop already infeasible 16.82/7.89 [2019-03-29 02:01:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 16.82/7.89 [2019-03-29 02:01:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 16.82/7.89 [2019-03-29 02:01:01,983 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. 16.82/7.89 [2019-03-29 02:01:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.82/7.89 [2019-03-29 02:01:02,020 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 16.82/7.89 [2019-03-29 02:01:02,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 16.82/7.89 [2019-03-29 02:01:02,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 16.82/7.89 [2019-03-29 02:01:02,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 16.82/7.89 [2019-03-29 02:01:02,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.82/7.89 [2019-03-29 02:01:02,024 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. 16.82/7.89 [2019-03-29 02:01:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 16.82/7.89 [2019-03-29 02:01:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 16.82/7.89 [2019-03-29 02:01:02,026 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 16.82/7.89 [2019-03-29 02:01:02,026 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 16.82/7.89 [2019-03-29 02:01:02,026 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 16.82/7.89 [2019-03-29 02:01:02,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. 16.82/7.89 [2019-03-29 02:01:02,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 16.82/7.89 [2019-03-29 02:01:02,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:02,027 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:02,027 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:02,027 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 16.82/7.89 [2019-03-29 02:01:02,028 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 145#L15-2 16.82/7.89 [2019-03-29 02:01:02,028 INFO L796 eck$LassoCheckResult]: Loop: 145#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 146#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 147#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 141#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 143#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 148#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 145#L15-2 16.82/7.89 [2019-03-29 02:01:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 3 times 16.82/7.89 [2019-03-29 02:01:02,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash -731444409, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:02,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 16.82/7.89 [2019-03-29 02:01:02,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 16.82/7.89 [2019-03-29 02:01:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core 16.82/7.89 [2019-03-29 02:01:02,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.82/7.89 [2019-03-29 02:01:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 16.82/7.89 [2019-03-29 02:01:02,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 16.82/7.89 [2019-03-29 02:01:02,174 INFO L811 eck$LassoCheckResult]: loop already infeasible 16.82/7.89 [2019-03-29 02:01:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 16.82/7.89 [2019-03-29 02:01:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 16.82/7.89 [2019-03-29 02:01:02,175 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. cyclomatic complexity: 5 Second operand 6 states. 16.82/7.89 [2019-03-29 02:01:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.82/7.89 [2019-03-29 02:01:02,253 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 16.82/7.89 [2019-03-29 02:01:02,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 16.82/7.89 [2019-03-29 02:01:02,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 16.82/7.89 [2019-03-29 02:01:02,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 16.82/7.89 [2019-03-29 02:01:02,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.82/7.89 [2019-03-29 02:01:02,258 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. 16.82/7.89 [2019-03-29 02:01:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. 16.82/7.89 [2019-03-29 02:01:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 16.82/7.89 [2019-03-29 02:01:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,261 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,261 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,261 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 16.82/7.89 [2019-03-29 02:01:02,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. 16.82/7.89 [2019-03-29 02:01:02,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 16.82/7.89 [2019-03-29 02:01:02,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:02,262 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:02,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:02,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] 16.82/7.89 [2019-03-29 02:01:02,263 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 195#L15-2 16.82/7.89 [2019-03-29 02:01:02,263 INFO L796 eck$LassoCheckResult]: Loop: 195#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 196#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 197#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 191#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 193#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 199#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 201#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 200#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L15-2 16.82/7.89 [2019-03-29 02:01:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 4 times 16.82/7.89 [2019-03-29 02:01:02,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1455881376, now seen corresponding path program 2 times 16.82/7.89 [2019-03-29 02:01:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 16.82/7.89 [2019-03-29 02:01:02,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 16.82/7.89 [2019-03-29 02:01:02,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 16.82/7.89 [2019-03-29 02:01:02,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 16.82/7.89 [2019-03-29 02:01:02,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core 16.82/7.89 [2019-03-29 02:01:02,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.82/7.89 [2019-03-29 02:01:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 16.82/7.89 [2019-03-29 02:01:02,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 16.82/7.89 [2019-03-29 02:01:02,422 INFO L811 eck$LassoCheckResult]: loop already infeasible 16.82/7.89 [2019-03-29 02:01:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 16.82/7.89 [2019-03-29 02:01:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 16.82/7.89 [2019-03-29 02:01:02,423 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. cyclomatic complexity: 7 Second operand 8 states. 16.82/7.89 [2019-03-29 02:01:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.82/7.89 [2019-03-29 02:01:02,621 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 16.82/7.89 [2019-03-29 02:01:02,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 16.82/7.89 [2019-03-29 02:01:02,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 16.82/7.89 [2019-03-29 02:01:02,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 16.82/7.89 [2019-03-29 02:01:02,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.82/7.89 [2019-03-29 02:01:02,628 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. 16.82/7.89 [2019-03-29 02:01:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. 16.82/7.89 [2019-03-29 02:01:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 16.82/7.89 [2019-03-29 02:01:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. 16.82/7.89 [2019-03-29 02:01:02,631 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. 16.82/7.89 [2019-03-29 02:01:02,631 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. 16.82/7.89 [2019-03-29 02:01:02,631 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 16.82/7.89 [2019-03-29 02:01:02,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. 16.82/7.89 [2019-03-29 02:01:02,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 16.82/7.89 [2019-03-29 02:01:02,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:02,632 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:02,632 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.82/7.89 [2019-03-29 02:01:02,632 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] 16.82/7.89 [2019-03-29 02:01:02,633 INFO L794 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 271#L15-2 16.82/7.89 [2019-03-29 02:01:02,633 INFO L796 eck$LassoCheckResult]: Loop: 271#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 268#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 269#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 266#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 267#L25-2 [104] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~l~0_11 1) v_ULTIMATE.start_main_~l~0_10) (< v_ULTIMATE.start_main_~m~0_8 0)) InVars {ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_11, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} OutVars{ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0] 278#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 274#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 275#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 277#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 276#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 271#L15-2 16.82/7.89 [2019-03-29 02:01:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 5 times 16.82/7.89 [2019-03-29 02:01:02,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1771364470, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:02,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 16.82/7.89 [2019-03-29 02:01:02,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 16.82/7.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.82/7.89 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 16.82/7.89 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 16.82/7.89 [2019-03-29 02:01:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.82/7.89 [2019-03-29 02:01:02,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 16.82/7.89 [2019-03-29 02:01:02,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.82/7.89 [2019-03-29 02:01:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 16.82/7.89 [2019-03-29 02:01:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 16.82/7.89 [2019-03-29 02:01:02,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 16.82/7.89 [2019-03-29 02:01:02,816 INFO L811 eck$LassoCheckResult]: loop already infeasible 16.82/7.89 [2019-03-29 02:01:02,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 16.82/7.89 [2019-03-29 02:01:02,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 16.82/7.89 [2019-03-29 02:01:02,817 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand 11 states. 16.82/7.89 [2019-03-29 02:01:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.82/7.89 [2019-03-29 02:01:02,940 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 16.82/7.89 [2019-03-29 02:01:02,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 16.82/7.89 [2019-03-29 02:01:02,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 16.82/7.89 [2019-03-29 02:01:02,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 16.82/7.89 [2019-03-29 02:01:02,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.82/7.89 [2019-03-29 02:01:02,946 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. 16.82/7.89 [2019-03-29 02:01:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 16.82/7.89 [2019-03-29 02:01:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,947 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,947 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,947 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 16.82/7.89 [2019-03-29 02:01:02,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. 16.82/7.89 [2019-03-29 02:01:02,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 16.82/7.89 [2019-03-29 02:01:02,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.82/7.89 [2019-03-29 02:01:02,948 INFO L119 BuchiIsEmpty]: Starting construction of run 16.82/7.89 [2019-03-29 02:01:02,948 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 16.82/7.89 [2019-03-29 02:01:02,949 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 16.82/7.89 [2019-03-29 02:01:02,949 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 336#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 337#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 338#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 333#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 334#L25-2 16.82/7.89 [2019-03-29 02:01:02,949 INFO L796 eck$LassoCheckResult]: Loop: 334#L25-2 [88] L25-2-->L25-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~m~0_6 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 334#L25-2 16.82/7.89 [2019-03-29 02:01:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash 108065989, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:02,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:02,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.82/7.89 [2019-03-29 02:01:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -944921549, now seen corresponding path program 1 times 16.82/7.89 [2019-03-29 02:01:02,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.82/7.89 [2019-03-29 02:01:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.82/7.89 [2019-03-29 02:01:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.82/7.89 [2019-03-29 02:01:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.82/7.89 [2019-03-29 02:01:03,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:03 BasicIcfg 16.82/7.89 [2019-03-29 02:01:03,054 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 16.82/7.89 [2019-03-29 02:01:03,055 INFO L168 Benchmark]: Toolchain (without parser) took 3371.14 ms. Allocated memory was 649.6 MB in the beginning and 736.1 MB in the end (delta: 86.5 MB). Free memory was 564.5 MB in the beginning and 675.3 MB in the end (delta: -110.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,056 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.03 ms. Allocated memory is still 649.6 MB. Free memory was 563.4 MB in the beginning and 553.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.02 ms. Allocated memory was 649.6 MB in the beginning and 651.7 MB in the end (delta: 2.1 MB). Free memory was 553.7 MB in the beginning and 618.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,058 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 ms. Allocated memory is still 651.7 MB. Free memory was 618.4 MB in the beginning and 615.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,059 INFO L168 Benchmark]: RCFGBuilder took 213.55 ms. Allocated memory is still 651.7 MB. Free memory was 615.6 MB in the beginning and 599.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,059 INFO L168 Benchmark]: BlockEncodingV2 took 87.84 ms. Allocated memory is still 651.7 MB. Free memory was 599.9 MB in the beginning and 594.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,060 INFO L168 Benchmark]: TraceAbstraction took 171.90 ms. Allocated memory is still 651.7 MB. Free memory was 594.5 MB in the beginning and 584.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,060 INFO L168 Benchmark]: BuchiAutomizer took 2545.95 ms. Allocated memory was 651.7 MB in the beginning and 736.1 MB in the end (delta: 84.4 MB). Free memory was 583.8 MB in the beginning and 675.3 MB in the end (delta: -91.6 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.82/7.89 [2019-03-29 02:01:03,064 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 16.82/7.89 --- Results --- 16.82/7.89 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 16.82/7.89 - StatisticsResult: Initial Icfg 16.82/7.89 14 locations, 23 edges 16.82/7.89 - StatisticsResult: Encoded RCFG 16.82/7.89 6 locations, 10 edges 16.82/7.89 * Results from de.uni_freiburg.informatik.ultimate.core: 16.82/7.89 - StatisticsResult: Toolchain Benchmarks 16.82/7.89 Benchmark results are: 16.82/7.89 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 16.82/7.89 * CACSL2BoogieTranslator took 233.03 ms. Allocated memory is still 649.6 MB. Free memory was 563.4 MB in the beginning and 553.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 16.82/7.89 * Boogie Procedure Inliner took 92.02 ms. Allocated memory was 649.6 MB in the beginning and 651.7 MB in the end (delta: 2.1 MB). Free memory was 553.7 MB in the beginning and 618.4 MB in the end (delta: -64.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 16.82/7.89 * Boogie Preprocessor took 21.51 ms. Allocated memory is still 651.7 MB. Free memory was 618.4 MB in the beginning and 615.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 16.82/7.89 * RCFGBuilder took 213.55 ms. Allocated memory is still 651.7 MB. Free memory was 615.6 MB in the beginning and 599.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 16.82/7.89 * BlockEncodingV2 took 87.84 ms. Allocated memory is still 651.7 MB. Free memory was 599.9 MB in the beginning and 594.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 16.82/7.89 * TraceAbstraction took 171.90 ms. Allocated memory is still 651.7 MB. Free memory was 594.5 MB in the beginning and 584.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 16.82/7.89 * BuchiAutomizer took 2545.95 ms. Allocated memory was 651.7 MB in the beginning and 736.1 MB in the end (delta: 84.4 MB). Free memory was 583.8 MB in the beginning and 675.3 MB in the end (delta: -91.6 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.82/7.89 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 16.82/7.89 - AllSpecificationsHoldResult: All specifications hold 16.82/7.89 We were not able to verify any specifiation because the program does not contain any specification. 16.82/7.89 - InvariantResult [Line: 23]: Loop Invariant 16.82/7.89 Derived loop invariant: 1 16.82/7.89 - InvariantResult [Line: 18]: Loop Invariant 16.82/7.89 Derived loop invariant: 1 16.82/7.89 - InvariantResult [Line: 25]: Loop Invariant 16.82/7.89 Derived loop invariant: 1 16.82/7.89 - InvariantResult [Line: 20]: Loop Invariant 16.82/7.89 Derived loop invariant: 1 16.82/7.89 - InvariantResult [Line: 15]: Loop Invariant 16.82/7.89 Derived loop invariant: 1 16.82/7.89 - StatisticsResult: Ultimate Automizer benchmark data 16.82/7.89 CFG has 1 procedures, 6 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 16.82/7.89 - StatisticsResult: Constructed decomposition of program 16.82/7.89 Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * i and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 6 locations. 16.82/7.89 - StatisticsResult: Timing statistics 16.82/7.89 BüchiAutomizer plugin needed 2.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 145 SDslu, 29 SDs, 0 SdLazy, 151 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 16.82/7.89 - TerminationAnalysisResult: Nontermination possible 16.82/7.89 Buchi Automizer proved that your program is nonterminating for some inputs 16.82/7.89 - FixpointNonTerminationResult [Line: 25]: Nontermination argument in form of an infinite program execution. 16.82/7.89 Nontermination argument in form of an infinite execution 16.82/7.89 State at position 0 is 16.82/7.89 {} 16.82/7.89 State at position 1 is 16.82/7.89 {a=2, \result=0, b=7, m=1003, l=0, i=0, k=3, j=0} 16.82/7.89 - StatisticsResult: NonterminationArgumentStatistics 16.82/7.89 Fixpoint 16.82/7.89 - NonterminatingLassoResult [Line: 25]: Nonterminating execution 16.82/7.89 Found a nonterminating execution for the following lasso shaped sequence of statements. 16.82/7.89 Stem: 16.82/7.89 [L6] int i; 16.82/7.89 [L7] int j; 16.82/7.89 [L8] int k; 16.82/7.89 [L9] int l; 16.82/7.89 [L10] int m; 16.82/7.89 [L11] int a; 16.82/7.89 [L12] int b; 16.82/7.89 [L13] i = 0 16.82/7.89 [L15] COND TRUE i < 100 16.82/7.89 [L16] a = i+2 16.82/7.89 [L17] j = 0 16.82/7.89 [L18] COND TRUE j < a 16.82/7.89 [L19] k = i+j+3 16.82/7.89 [L20] COND TRUE k >= 0 16.82/7.89 [L21] b = i+j+k+4 16.82/7.89 [L22] l = 0 16.82/7.89 [L23] COND TRUE l < b 16.82/7.89 [L24] m = i+j+k+l+1000 16.82/7.89 Loop: 16.82/7.89 [L25] COND TRUE m >= 0 16.82/7.89 [L26] m = m-0 16.82/7.89 End of lasso representation. 16.82/7.89 RESULT: Ultimate proved your program to be incorrect! 16.82/7.89 !SESSION 2019-03-29 02:00:56.352 ----------------------------------------------- 16.82/7.89 eclipse.buildId=unknown 16.82/7.89 java.version=1.8.0_181 16.82/7.89 java.vendor=Oracle Corporation 16.82/7.89 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 16.82/7.89 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 16.82/7.89 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 16.82/7.89 16.82/7.89 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 02:01:03.301 16.82/7.89 !MESSAGE The workspace will exit with unsaved changes in this session. 16.82/7.89 Received shutdown request... 16.82/7.89 Ultimate: 16.82/7.89 GTK+ Version Check 16.82/7.89 EOF