28.22/13.09 YES 28.22/13.09 28.22/13.09 Ultimate: Cannot open display: 28.22/13.09 This is Ultimate 0.1.24-8dc7c08-m 28.22/13.09 [2019-03-28 22:39:00,510 INFO L170 SettingsManager]: Resetting all preferences to default values... 28.22/13.09 [2019-03-28 22:39:00,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 28.22/13.09 [2019-03-28 22:39:00,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 28.22/13.09 [2019-03-28 22:39:00,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 28.22/13.09 [2019-03-28 22:39:00,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 28.22/13.09 [2019-03-28 22:39:00,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 28.22/13.09 [2019-03-28 22:39:00,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 28.22/13.09 [2019-03-28 22:39:00,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 28.22/13.09 [2019-03-28 22:39:00,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 28.22/13.09 [2019-03-28 22:39:00,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 28.22/13.09 [2019-03-28 22:39:00,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 28.22/13.09 [2019-03-28 22:39:00,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 28.22/13.09 [2019-03-28 22:39:00,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 28.22/13.09 [2019-03-28 22:39:00,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 28.22/13.09 [2019-03-28 22:39:00,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 28.22/13.09 [2019-03-28 22:39:00,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 28.22/13.09 [2019-03-28 22:39:00,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 28.22/13.09 [2019-03-28 22:39:00,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 28.22/13.09 [2019-03-28 22:39:00,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 28.22/13.09 [2019-03-28 22:39:00,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 28.22/13.09 [2019-03-28 22:39:00,545 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 28.22/13.09 [2019-03-28 22:39:00,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 28.22/13.09 [2019-03-28 22:39:00,546 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 28.22/13.09 [2019-03-28 22:39:00,547 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 28.22/13.09 [2019-03-28 22:39:00,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 28.22/13.09 [2019-03-28 22:39:00,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 28.22/13.09 [2019-03-28 22:39:00,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 28.22/13.09 [2019-03-28 22:39:00,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 28.22/13.09 [2019-03-28 22:39:00,550 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 28.22/13.09 [2019-03-28 22:39:00,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 28.22/13.09 [2019-03-28 22:39:00,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 28.22/13.09 [2019-03-28 22:39:00,552 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 28.22/13.09 [2019-03-28 22:39:00,567 INFO L110 SettingsManager]: Loading preferences was successful 28.22/13.09 [2019-03-28 22:39:00,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 28.22/13.09 [2019-03-28 22:39:00,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 28.22/13.09 [2019-03-28 22:39:00,569 INFO L133 SettingsManager]: * Rewrite not-equals=true 28.22/13.09 [2019-03-28 22:39:00,569 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 28.22/13.09 [2019-03-28 22:39:00,569 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 28.22/13.09 [2019-03-28 22:39:00,569 INFO L133 SettingsManager]: * Use SBE=true 28.22/13.09 [2019-03-28 22:39:00,569 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 28.22/13.09 [2019-03-28 22:39:00,569 INFO L133 SettingsManager]: * Use old map elimination=false 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 28.22/13.09 [2019-03-28 22:39:00,570 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:00,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 28.22/13.09 [2019-03-28 22:39:00,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 28.22/13.09 [2019-03-28 22:39:00,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE 28.22/13.09 [2019-03-28 22:39:00,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 28.22/13.09 [2019-03-28 22:39:00,571 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 28.22/13.09 [2019-03-28 22:39:00,572 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 28.22/13.09 [2019-03-28 22:39:00,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 28.22/13.09 [2019-03-28 22:39:00,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 28.22/13.09 [2019-03-28 22:39:00,572 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 28.22/13.09 [2019-03-28 22:39:00,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.22/13.09 [2019-03-28 22:39:00,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 28.22/13.09 [2019-03-28 22:39:00,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 28.22/13.09 [2019-03-28 22:39:00,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 28.22/13.09 [2019-03-28 22:39:00,573 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 28.22/13.09 [2019-03-28 22:39:00,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 28.22/13.09 [2019-03-28 22:39:00,612 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 28.22/13.09 [2019-03-28 22:39:00,615 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 28.22/13.09 [2019-03-28 22:39:00,617 INFO L271 PluginConnector]: Initializing CDTParser... 28.22/13.09 [2019-03-28 22:39:00,617 INFO L276 PluginConnector]: CDTParser initialized 28.22/13.09 [2019-03-28 22:39:00,618 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 28.22/13.09 [2019-03-28 22:39:00,722 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/42577bed66a04636829cd120a54b8163/FLAG8e2d9a4b2 28.22/13.09 [2019-03-28 22:39:01,054 INFO L307 CDTParser]: Found 1 translation units. 28.22/13.09 [2019-03-28 22:39:01,055 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 28.22/13.09 [2019-03-28 22:39:01,061 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/42577bed66a04636829cd120a54b8163/FLAG8e2d9a4b2 28.22/13.09 [2019-03-28 22:39:01,463 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/42577bed66a04636829cd120a54b8163 28.22/13.09 [2019-03-28 22:39:01,476 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 28.22/13.09 [2019-03-28 22:39:01,477 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 28.22/13.09 [2019-03-28 22:39:01,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 28.22/13.09 [2019-03-28 22:39:01,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 28.22/13.09 [2019-03-28 22:39:01,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 28.22/13.09 [2019-03-28 22:39:01,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6518236f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:01,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 28.22/13.09 [2019-03-28 22:39:01,512 INFO L176 MainTranslator]: Built tables and reachable declarations 28.22/13.09 [2019-03-28 22:39:01,666 INFO L206 PostProcessor]: Analyzing one entry point: main 28.22/13.09 [2019-03-28 22:39:01,671 INFO L191 MainTranslator]: Completed pre-run 28.22/13.09 [2019-03-28 22:39:01,687 INFO L206 PostProcessor]: Analyzing one entry point: main 28.22/13.09 [2019-03-28 22:39:01,701 INFO L195 MainTranslator]: Completed translation 28.22/13.09 [2019-03-28 22:39:01,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01 WrapperNode 28.22/13.09 [2019-03-28 22:39:01,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 28.22/13.09 [2019-03-28 22:39:01,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 28.22/13.09 [2019-03-28 22:39:01,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 28.22/13.09 [2019-03-28 22:39:01,703 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 28.22/13.09 [2019-03-28 22:39:01,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 28.22/13.09 [2019-03-28 22:39:01,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 28.22/13.09 [2019-03-28 22:39:01,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 28.22/13.09 [2019-03-28 22:39:01,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized 28.22/13.09 [2019-03-28 22:39:01,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 [2019-03-28 22:39:01,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 28.22/13.09 [2019-03-28 22:39:01,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 28.22/13.09 [2019-03-28 22:39:01,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... 28.22/13.09 [2019-03-28 22:39:01,815 INFO L276 PluginConnector]: RCFGBuilder initialized 28.22/13.09 [2019-03-28 22:39:01,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (1/1) ... 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.22/13.09 [2019-03-28 22:39:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 28.22/13.09 [2019-03-28 22:39:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 28.22/13.09 [2019-03-28 22:39:02,020 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 28.22/13.09 [2019-03-28 22:39:02,021 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 28.22/13.09 [2019-03-28 22:39:02,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:02 BoogieIcfgContainer 28.22/13.09 [2019-03-28 22:39:02,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 28.22/13.09 [2019-03-28 22:39:02,023 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 28.22/13.09 [2019-03-28 22:39:02,023 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 28.22/13.09 [2019-03-28 22:39:02,026 INFO L276 PluginConnector]: BlockEncodingV2 initialized 28.22/13.09 [2019-03-28 22:39:02,026 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:02" (1/1) ... 28.22/13.09 [2019-03-28 22:39:02,042 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges 28.22/13.09 [2019-03-28 22:39:02,044 INFO L258 BlockEncoder]: Using Remove infeasible edges 28.22/13.09 [2019-03-28 22:39:02,045 INFO L263 BlockEncoder]: Using Maximize final states 28.22/13.09 [2019-03-28 22:39:02,045 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 28.22/13.09 [2019-03-28 22:39:02,045 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 28.22/13.09 [2019-03-28 22:39:02,047 INFO L296 BlockEncoder]: Using Remove sink states 28.22/13.09 [2019-03-28 22:39:02,048 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 28.22/13.09 [2019-03-28 22:39:02,049 INFO L179 BlockEncoder]: Using Rewrite not-equals 28.22/13.09 [2019-03-28 22:39:02,064 INFO L185 BlockEncoder]: Using Use SBE 28.22/13.09 [2019-03-28 22:39:02,073 INFO L200 BlockEncoder]: SBE split 0 edges 28.22/13.09 [2019-03-28 22:39:02,079 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 28.22/13.09 [2019-03-28 22:39:02,081 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.22/13.09 [2019-03-28 22:39:02,096 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 28.22/13.09 [2019-03-28 22:39:02,098 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 28.22/13.09 [2019-03-28 22:39:02,099 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.22/13.09 [2019-03-28 22:39:02,100 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.22/13.09 [2019-03-28 22:39:02,100 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 28.22/13.09 [2019-03-28 22:39:02,100 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.22/13.09 [2019-03-28 22:39:02,100 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges 28.22/13.09 [2019-03-28 22:39:02,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:02 BasicIcfg 28.22/13.09 [2019-03-28 22:39:02,101 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 28.22/13.09 [2019-03-28 22:39:02,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 28.22/13.09 [2019-03-28 22:39:02,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... 28.22/13.09 [2019-03-28 22:39:02,106 INFO L276 PluginConnector]: TraceAbstraction initialized 28.22/13.09 [2019-03-28 22:39:02,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:39:01" (1/4) ... 28.22/13.09 [2019-03-28 22:39:02,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d3b014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (2/4) ... 28.22/13.09 [2019-03-28 22:39:02,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d3b014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:02" (3/4) ... 28.22/13.09 [2019-03-28 22:39:02,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d3b014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:02" (4/4) ... 28.22/13.09 [2019-03-28 22:39:02,111 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.22/13.09 [2019-03-28 22:39:02,123 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 28.22/13.09 [2019-03-28 22:39:02,132 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 28.22/13.09 [2019-03-28 22:39:02,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 28.22/13.09 [2019-03-28 22:39:02,182 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.22/13.09 [2019-03-28 22:39:02,183 INFO L382 AbstractCegarLoop]: Interprodecural is true 28.22/13.09 [2019-03-28 22:39:02,183 INFO L383 AbstractCegarLoop]: Hoare is true 28.22/13.09 [2019-03-28 22:39:02,183 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 28.22/13.09 [2019-03-28 22:39:02,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 28.22/13.09 [2019-03-28 22:39:02,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.22/13.09 [2019-03-28 22:39:02,184 INFO L387 AbstractCegarLoop]: Difference is false 28.22/13.09 [2019-03-28 22:39:02,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 28.22/13.09 [2019-03-28 22:39:02,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 28.22/13.09 [2019-03-28 22:39:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:02,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 28.22/13.09 [2019-03-28 22:39:02,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 28.22/13.09 [2019-03-28 22:39:02,261 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 28.22/13.09 [2019-03-28 22:39:02,262 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. 28.22/13.09 [2019-03-28 22:39:02,262 INFO L451 ceAbstractionStarter]: At program point L12-2(lines 11 19) the Hoare annotation is: true 28.22/13.09 [2019-03-28 22:39:02,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:02 BasicIcfg 28.22/13.09 [2019-03-28 22:39:02,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 28.22/13.09 [2019-03-28 22:39:02,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 28.22/13.09 [2019-03-28 22:39:02,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 28.22/13.09 [2019-03-28 22:39:02,276 INFO L276 PluginConnector]: BuchiAutomizer initialized 28.22/13.09 [2019-03-28 22:39:02,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.22/13.09 [2019-03-28 22:39:02,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:39:01" (1/5) ... 28.22/13.09 [2019-03-28 22:39:02,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630fac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,279 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.22/13.09 [2019-03-28 22:39:02,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:01" (2/5) ... 28.22/13.09 [2019-03-28 22:39:02,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630fac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,279 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.22/13.09 [2019-03-28 22:39:02,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:02" (3/5) ... 28.22/13.09 [2019-03-28 22:39:02,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630fac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.22/13.09 [2019-03-28 22:39:02,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:02" (4/5) ... 28.22/13.09 [2019-03-28 22:39:02,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630fac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:02, skipping insertion in model container 28.22/13.09 [2019-03-28 22:39:02,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.22/13.09 [2019-03-28 22:39:02,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:02" (5/5) ... 28.22/13.09 [2019-03-28 22:39:02,283 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.22/13.09 [2019-03-28 22:39:02,314 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.22/13.09 [2019-03-28 22:39:02,314 INFO L374 BuchiCegarLoop]: Interprodecural is true 28.22/13.09 [2019-03-28 22:39:02,314 INFO L375 BuchiCegarLoop]: Hoare is true 28.22/13.09 [2019-03-28 22:39:02,314 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 28.22/13.09 [2019-03-28 22:39:02,314 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 28.22/13.09 [2019-03-28 22:39:02,315 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.22/13.09 [2019-03-28 22:39:02,315 INFO L379 BuchiCegarLoop]: Difference is false 28.22/13.09 [2019-03-28 22:39:02,315 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 28.22/13.09 [2019-03-28 22:39:02,315 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 28.22/13.09 [2019-03-28 22:39:02,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:02,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 28.22/13.09 [2019-03-28 22:39:02,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.09 [2019-03-28 22:39:02,338 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.09 [2019-03-28 22:39:02,344 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 28.22/13.09 [2019-03-28 22:39:02,344 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 28.22/13.09 [2019-03-28 22:39:02,344 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 28.22/13.09 [2019-03-28 22:39:02,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:02,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 28.22/13.09 [2019-03-28 22:39:02,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.09 [2019-03-28 22:39:02,346 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.09 [2019-03-28 22:39:02,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 28.22/13.09 [2019-03-28 22:39:02,346 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 28.22/13.09 [2019-03-28 22:39:02,352 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true 28.22/13.09 [2019-03-28 22:39:02,352 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 5#L12true [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true 28.22/13.09 [2019-03-28 22:39:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:02,360 INFO L82 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:02,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:02,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash 57539, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:02,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:02,516 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:02,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:02,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:02,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:02,518 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.09 [2019-03-28 22:39:02,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:02,518 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:02,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 28.22/13.09 [2019-03-28 22:39:02,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:02,519 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:02,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,659 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:02,660 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,667 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,700 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:02,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:02,716 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,744 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:02,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:02,771 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: [] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,777 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:02,804 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:02,805 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: [] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,810 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:02,842 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:02,873 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.09 [2019-03-28 22:39:02,876 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:02,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:02,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:02,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:02,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.09 [2019-03-28 22:39:02,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:02,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:02,877 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:02,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 28.22/13.09 [2019-03-28 22:39:02,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:02,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:02,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:02,974 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:02,980 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.09 [2019-03-28 22:39:02,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:02,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:02,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:02,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:02,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:02,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:02,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:02,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.09 [2019-03-28 22:39:03,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.09 [2019-03-28 22:39:03,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.09 [2019-03-28 22:39:03,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:03,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,037 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.09 [2019-03-28 22:39:03,042 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.09 [2019-03-28 22:39:03,042 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 28.22/13.09 [2019-03-28 22:39:03,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.09 [2019-03-28 22:39:03,045 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.09 [2019-03-28 22:39:03,045 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.09 [2019-03-28 22:39:03,045 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.09 Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 28.22/13.09 Supporting invariants [] 28.22/13.09 [2019-03-28 22:39:03,047 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.09 [2019-03-28 22:39:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:03,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:03,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:03,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:03,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.09 [2019-03-28 22:39:03,110 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 28.22/13.09 [2019-03-28 22:39:03,115 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 1 loop predicates 28.22/13.09 [2019-03-28 22:39:03,117 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 28.22/13.09 [2019-03-28 22:39:03,142 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. 28.22/13.09 [2019-03-28 22:39:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 28.22/13.09 [2019-03-28 22:39:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 28.22/13.09 [2019-03-28 22:39:03,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:03,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. 28.22/13.09 [2019-03-28 22:39:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 28.22/13.09 [2019-03-28 22:39:03,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 28.22/13.09 [2019-03-28 22:39:03,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 28.22/13.09 [2019-03-28 22:39:03,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.09 [2019-03-28 22:39:03,162 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 28.22/13.09 [2019-03-28 22:39:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 28.22/13.09 [2019-03-28 22:39:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,192 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,192 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,192 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 28.22/13.09 [2019-03-28 22:39:03,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:03,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 28.22/13.09 [2019-03-28 22:39:03,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.09 [2019-03-28 22:39:03,193 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.09 [2019-03-28 22:39:03,194 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 28.22/13.09 [2019-03-28 22:39:03,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 28.22/13.09 [2019-03-28 22:39:03,194 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 47#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 45#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 28.22/13.09 [2019-03-28 22:39:03,195 INFO L796 eck$LassoCheckResult]: Loop: 41#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 42#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 28.22/13.09 [2019-03-28 22:39:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 57534, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:03,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 2 times 28.22/13.09 [2019-03-28 22:39:03,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash 55291014, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:03,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.09 [2019-03-28 22:39:03,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.22/13.09 [2019-03-28 22:39:03,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 28.22/13.09 [2019-03-28 22:39:03,285 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:03,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:03,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:03,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:03,286 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.09 [2019-03-28 22:39:03,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,286 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:03,286 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:03,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 28.22/13.09 [2019-03-28 22:39:03,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:03,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:03,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,349 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:03,349 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,353 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:03,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:03,380 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,385 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:03,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:03,412 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,418 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,449 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:03,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:03,459 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,490 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,524 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:03,554 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.09 [2019-03-28 22:39:03,557 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:03,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:03,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:03,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:03,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.09 [2019-03-28 22:39:03,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:03,558 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:03,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 28.22/13.09 [2019-03-28 22:39:03,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:03,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:03,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,653 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:03,653 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.09 [2019-03-28 22:39:03,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.09 [2019-03-28 22:39:03,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:03,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.09 [2019-03-28 22:39:03,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:03,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:03,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:03,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:03,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:03,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:03,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:03,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:03,675 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.09 [2019-03-28 22:39:03,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.09 [2019-03-28 22:39:03,679 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 28.22/13.09 [2019-03-28 22:39:03,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.09 [2019-03-28 22:39:03,679 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.09 [2019-03-28 22:39:03,679 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.09 [2019-03-28 22:39:03,679 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.09 Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 28.22/13.09 Supporting invariants [] 28.22/13.09 [2019-03-28 22:39:03,680 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.09 [2019-03-28 22:39:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:03,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:03,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:03,711 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.09 [2019-03-28 22:39:03,713 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 28.22/13.09 [2019-03-28 22:39:03,713 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 1 loop predicates 28.22/13.09 [2019-03-28 22:39:03,713 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. 28.22/13.09 [2019-03-28 22:39:03,730 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. 28.22/13.09 [2019-03-28 22:39:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 28.22/13.09 [2019-03-28 22:39:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 28.22/13.09 [2019-03-28 22:39:03,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:03,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:03,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. 28.22/13.09 [2019-03-28 22:39:03,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:03,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. 28.22/13.09 [2019-03-28 22:39:03,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 28.22/13.09 [2019-03-28 22:39:03,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. 28.22/13.09 [2019-03-28 22:39:03,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 28.22/13.09 [2019-03-28 22:39:03,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 28.22/13.09 [2019-03-28 22:39:03,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. 28.22/13.09 [2019-03-28 22:39:03,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.09 [2019-03-28 22:39:03,737 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. 28.22/13.09 [2019-03-28 22:39:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. 28.22/13.09 [2019-03-28 22:39:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. 28.22/13.09 [2019-03-28 22:39:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 28.22/13.09 [2019-03-28 22:39:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. 28.22/13.09 [2019-03-28 22:39:03,739 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 28.22/13.09 [2019-03-28 22:39:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 28.22/13.09 [2019-03-28 22:39:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 28.22/13.09 [2019-03-28 22:39:03,742 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. 28.22/13.09 [2019-03-28 22:39:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.22/13.09 [2019-03-28 22:39:03,761 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. 28.22/13.09 [2019-03-28 22:39:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 28.22/13.09 [2019-03-28 22:39:03,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. 28.22/13.09 [2019-03-28 22:39:03,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 28.22/13.09 [2019-03-28 22:39:03,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:03,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 28.22/13.09 [2019-03-28 22:39:03,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 28.22/13.09 [2019-03-28 22:39:03,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:03,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.09 [2019-03-28 22:39:03,765 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. 28.22/13.09 [2019-03-28 22:39:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 28.22/13.09 [2019-03-28 22:39:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. 28.22/13.09 [2019-03-28 22:39:03,767 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. 28.22/13.09 [2019-03-28 22:39:03,767 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. 28.22/13.09 [2019-03-28 22:39:03,767 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 28.22/13.09 [2019-03-28 22:39:03,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. 28.22/13.09 [2019-03-28 22:39:03,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 28.22/13.09 [2019-03-28 22:39:03,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.09 [2019-03-28 22:39:03,767 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.09 [2019-03-28 22:39:03,768 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 28.22/13.09 [2019-03-28 22:39:03,768 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 28.22/13.09 [2019-03-28 22:39:03,768 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 107#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 108#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 109#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 28.22/13.09 [2019-03-28 22:39:03,769 INFO L796 eck$LassoCheckResult]: Loop: 110#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 112#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 28.22/13.09 [2019-03-28 22:39:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 2 times 28.22/13.09 [2019-03-28 22:39:03,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1886, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:03,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1714170260, now seen corresponding path program 2 times 28.22/13.09 [2019-03-28 22:39:03,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:03,817 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:03,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:03,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:03,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:03,817 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.09 [2019-03-28 22:39:03,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:03,818 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:03,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.22/13.09 [2019-03-28 22:39:03,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:03,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:03,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,912 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:03,913 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:03,953 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:03,983 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.09 [2019-03-28 22:39:03,985 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:03,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:03,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:03,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:03,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.09 [2019-03-28 22:39:03,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:03,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:03,986 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:03,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.22/13.09 [2019-03-28 22:39:03,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:03,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:03,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:03,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,072 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:04,072 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.09 [2019-03-28 22:39:04,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:04,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:04,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:04,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:04,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:04,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:04,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:04,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:04,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.09 [2019-03-28 22:39:04,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.09 [2019-03-28 22:39:04,082 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.22/13.09 [2019-03-28 22:39:04,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.09 [2019-03-28 22:39:04,082 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.09 [2019-03-28 22:39:04,083 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.09 [2019-03-28 22:39:04,083 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.09 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 28.22/13.09 Supporting invariants [] 28.22/13.09 [2019-03-28 22:39:04,083 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.09 [2019-03-28 22:39:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:04,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:04,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:04,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:04,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.09 [2019-03-28 22:39:04,148 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 28.22/13.09 [2019-03-28 22:39:04,149 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 28.22/13.09 [2019-03-28 22:39:04,149 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. 28.22/13.09 [2019-03-28 22:39:04,158 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 12 transitions. Complement of second has 4 states. 28.22/13.09 [2019-03-28 22:39:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 28.22/13.09 [2019-03-28 22:39:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 28.22/13.09 [2019-03-28 22:39:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. 28.22/13.09 [2019-03-28 22:39:04,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:04,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:04,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. 28.22/13.09 [2019-03-28 22:39:04,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:04,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. 28.22/13.09 [2019-03-28 22:39:04,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.09 [2019-03-28 22:39:04,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. 28.22/13.09 [2019-03-28 22:39:04,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.22/13.09 [2019-03-28 22:39:04,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:04,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 28.22/13.09 [2019-03-28 22:39:04,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 28.22/13.09 [2019-03-28 22:39:04,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:04,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.09 [2019-03-28 22:39:04,164 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. 28.22/13.09 [2019-03-28 22:39:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. 28.22/13.09 [2019-03-28 22:39:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 28.22/13.09 [2019-03-28 22:39:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:04,165 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:04,165 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:04,166 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 28.22/13.09 [2019-03-28 22:39:04,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. 28.22/13.09 [2019-03-28 22:39:04,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 28.22/13.09 [2019-03-28 22:39:04,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.09 [2019-03-28 22:39:04,166 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.09 [2019-03-28 22:39:04,167 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 28.22/13.09 [2019-03-28 22:39:04,167 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] 28.22/13.09 [2019-03-28 22:39:04,167 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 163#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 28.22/13.09 [2019-03-28 22:39:04,167 INFO L796 eck$LassoCheckResult]: Loop: 168#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 165#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 28.22/13.09 [2019-03-28 22:39:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 3 times 28.22/13.09 [2019-03-28 22:39:04,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1813526, now seen corresponding path program 1 times 28.22/13.09 [2019-03-28 22:39:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1949820724, now seen corresponding path program 3 times 28.22/13.09 [2019-03-28 22:39:04,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.09 [2019-03-28 22:39:04,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.09 [2019-03-28 22:39:04,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.09 [2019-03-28 22:39:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.09 [2019-03-28 22:39:04,248 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:04,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:04,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:04,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:04,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.09 [2019-03-28 22:39:04,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:04,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:04,249 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:04,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 28.22/13.09 [2019-03-28 22:39:04,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:04,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:04,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,343 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:04,343 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:04,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:04,351 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:04,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.09 [2019-03-28 22:39:04,379 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:04,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:04,384 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.09 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.09 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:04,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.09 [2019-03-28 22:39:04,417 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.09 [2019-03-28 22:39:04,422 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.09 [2019-03-28 22:39:04,446 INFO L216 LassoAnalysis]: Preferences: 28.22/13.09 [2019-03-28 22:39:04,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.09 [2019-03-28 22:39:04,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.09 [2019-03-28 22:39:04,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.09 [2019-03-28 22:39:04,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.09 [2019-03-28 22:39:04,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.09 [2019-03-28 22:39:04,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.09 [2019-03-28 22:39:04,447 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.09 [2019-03-28 22:39:04,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 28.22/13.09 [2019-03-28 22:39:04,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.09 [2019-03-28 22:39:04,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.09 [2019-03-28 22:39:04,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.09 [2019-03-28 22:39:04,511 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.09 [2019-03-28 22:39:04,511 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.09 [2019-03-28 22:39:04,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.09 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.09 Number of strict supporting invariants: 0 28.22/13.09 Number of non-strict supporting invariants: 1 28.22/13.09 Consider only non-deceasing supporting invariants: true 28.22/13.09 Simplify termination arguments: true 28.22/13.09 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.09 [2019-03-28 22:39:04,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.09 [2019-03-28 22:39:04,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.09 [2019-03-28 22:39:04,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.09 [2019-03-28 22:39:04,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.09 [2019-03-28 22:39:04,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.09 [2019-03-28 22:39:04,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.09 [2019-03-28 22:39:04,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.09 [2019-03-28 22:39:04,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.09 [2019-03-28 22:39:04,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.09 [2019-03-28 22:39:04,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 28.22/13.09 [2019-03-28 22:39:04,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.09 [2019-03-28 22:39:04,522 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.09 [2019-03-28 22:39:04,522 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.09 [2019-03-28 22:39:04,522 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.09 Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 221 28.22/13.09 Supporting invariants [] 28.22/13.09 [2019-03-28 22:39:04,523 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.09 [2019-03-28 22:39:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.09 [2019-03-28 22:39:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:04,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:04,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:04,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:04,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.09 [2019-03-28 22:39:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.09 [2019-03-28 22:39:04,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 28.22/13.09 [2019-03-28 22:39:04,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.09 [2019-03-28 22:39:04,620 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 28.22/13.09 [2019-03-28 22:39:04,621 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 28.22/13.09 [2019-03-28 22:39:04,621 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. 28.22/13.09 [2019-03-28 22:39:04,642 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. 28.22/13.09 [2019-03-28 22:39:04,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 28.22/13.09 [2019-03-28 22:39:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 28.22/13.09 [2019-03-28 22:39:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. 28.22/13.09 [2019-03-28 22:39:04,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. 28.22/13.10 [2019-03-28 22:39:04,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. 28.22/13.10 [2019-03-28 22:39:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. 28.22/13.10 [2019-03-28 22:39:04,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:04,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. 28.22/13.10 [2019-03-28 22:39:04,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 28.22/13.10 [2019-03-28 22:39:04,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. 28.22/13.10 [2019-03-28 22:39:04,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 28.22/13.10 [2019-03-28 22:39:04,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 28.22/13.10 [2019-03-28 22:39:04,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. 28.22/13.10 [2019-03-28 22:39:04,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:04,649 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 28.22/13.10 [2019-03-28 22:39:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. 28.22/13.10 [2019-03-28 22:39:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 28.22/13.10 [2019-03-28 22:39:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 28.22/13.10 [2019-03-28 22:39:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 28.22/13.10 [2019-03-28 22:39:04,651 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 28.22/13.10 [2019-03-28 22:39:04,651 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 28.22/13.10 [2019-03-28 22:39:04,651 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 28.22/13.10 [2019-03-28 22:39:04,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. 28.22/13.10 [2019-03-28 22:39:04,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 28.22/13.10 [2019-03-28 22:39:04,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.10 [2019-03-28 22:39:04,652 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.10 [2019-03-28 22:39:04,653 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 28.22/13.10 [2019-03-28 22:39:04,653 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] 28.22/13.10 [2019-03-28 22:39:04,653 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 251#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 252#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 258#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L12 28.22/13.10 [2019-03-28 22:39:04,654 INFO L796 eck$LassoCheckResult]: Loop: 256#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 253#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 264#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 263#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 262#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 261#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 260#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 252#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 258#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L12 28.22/13.10 [2019-03-28 22:39:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 4 times 28.22/13.10 [2019-03-28 22:39:04,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1368636088, now seen corresponding path program 2 times 28.22/13.10 [2019-03-28 22:39:04,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2050633346, now seen corresponding path program 4 times 28.22/13.10 [2019-03-28 22:39:04,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 28.22/13.10 [2019-03-28 22:39:04,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 28.22/13.10 [2019-03-28 22:39:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 28.22/13.10 [2019-03-28 22:39:04,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 28.22/13.10 [2019-03-28 22:39:04,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:04,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:04,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:04,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 28.22/13.10 [2019-03-28 22:39:04,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 28.22/13.10 [2019-03-28 22:39:04,860 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:04,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:04,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:04,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:04,861 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.10 [2019-03-28 22:39:04,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:04,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:04,861 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:04,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 28.22/13.10 [2019-03-28 22:39:04,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:04,861 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:04,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:04,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:04,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:04,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:04,921 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:04,922 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:04,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:04,925 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:04,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:04,954 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 [2019-03-28 22:39:05,053 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.10 [2019-03-28 22:39:05,056 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:05,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:05,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:05,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:05,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.10 [2019-03-28 22:39:05,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:05,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:05,057 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:05,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 28.22/13.10 [2019-03-28 22:39:05,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:05,057 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:05,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:05,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:05,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:05,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:05,116 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:05,116 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.10 [2019-03-28 22:39:05,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.10 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.10 Number of strict supporting invariants: 0 28.22/13.10 Number of non-strict supporting invariants: 1 28.22/13.10 Consider only non-deceasing supporting invariants: true 28.22/13.10 Simplify termination arguments: true 28.22/13.10 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.10 [2019-03-28 22:39:05,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.10 [2019-03-28 22:39:05,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.10 [2019-03-28 22:39:05,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.10 [2019-03-28 22:39:05,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.10 [2019-03-28 22:39:05,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.10 [2019-03-28 22:39:05,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.10 [2019-03-28 22:39:05,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.10 [2019-03-28 22:39:05,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.10 [2019-03-28 22:39:05,124 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.10 [2019-03-28 22:39:05,124 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.22/13.10 [2019-03-28 22:39:05,125 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.10 [2019-03-28 22:39:05,125 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.10 [2019-03-28 22:39:05,125 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.10 [2019-03-28 22:39:05,125 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.10 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 28.22/13.10 Supporting invariants [] 28.22/13.10 [2019-03-28 22:39:05,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.10 [2019-03-28 22:39:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,410 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 13 predicates after loop cannibalization 28.22/13.10 [2019-03-28 22:39:05,411 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 13 loop predicates 28.22/13.10 [2019-03-28 22:39:05,411 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 7 states. 28.22/13.10 [2019-03-28 22:39:05,480 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 129 states and 152 transitions. Complement of second has 34 states. 28.22/13.10 [2019-03-28 22:39:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 28.22/13.10 [2019-03-28 22:39:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 28.22/13.10 [2019-03-28 22:39:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. 28.22/13.10 [2019-03-28 22:39:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. 28.22/13.10 [2019-03-28 22:39:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 14 letters. Loop has 10 letters. 28.22/13.10 [2019-03-28 22:39:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 20 letters. 28.22/13.10 [2019-03-28 22:39:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:05,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 152 transitions. 28.22/13.10 [2019-03-28 22:39:05,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 28.22/13.10 [2019-03-28 22:39:05,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 64 states and 85 transitions. 28.22/13.10 [2019-03-28 22:39:05,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 28.22/13.10 [2019-03-28 22:39:05,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 28.22/13.10 [2019-03-28 22:39:05,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 85 transitions. 28.22/13.10 [2019-03-28 22:39:05,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:05,493 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 85 transitions. 28.22/13.10 [2019-03-28 22:39:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 85 transitions. 28.22/13.10 [2019-03-28 22:39:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. 28.22/13.10 [2019-03-28 22:39:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 28.22/13.10 [2019-03-28 22:39:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. 28.22/13.10 [2019-03-28 22:39:05,498 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. 28.22/13.10 [2019-03-28 22:39:05,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 28.22/13.10 [2019-03-28 22:39:05,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 28.22/13.10 [2019-03-28 22:39:05,499 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand 5 states. 28.22/13.10 [2019-03-28 22:39:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.22/13.10 [2019-03-28 22:39:05,514 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. 28.22/13.10 [2019-03-28 22:39:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 28.22/13.10 [2019-03-28 22:39:05,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. 28.22/13.10 [2019-03-28 22:39:05,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 28.22/13.10 [2019-03-28 22:39:05,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 49 states and 66 transitions. 28.22/13.10 [2019-03-28 22:39:05,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 28.22/13.10 [2019-03-28 22:39:05,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 28.22/13.10 [2019-03-28 22:39:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. 28.22/13.10 [2019-03-28 22:39:05,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:05,519 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. 28.22/13.10 [2019-03-28 22:39:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. 28.22/13.10 [2019-03-28 22:39:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. 28.22/13.10 [2019-03-28 22:39:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 28.22/13.10 [2019-03-28 22:39:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. 28.22/13.10 [2019-03-28 22:39:05,523 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. 28.22/13.10 [2019-03-28 22:39:05,523 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. 28.22/13.10 [2019-03-28 22:39:05,523 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 28.22/13.10 [2019-03-28 22:39:05,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. 28.22/13.10 [2019-03-28 22:39:05,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 28.22/13.10 [2019-03-28 22:39:05,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.10 [2019-03-28 22:39:05,525 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.10 [2019-03-28 22:39:05,525 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] 28.22/13.10 [2019-03-28 22:39:05,525 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] 28.22/13.10 [2019-03-28 22:39:05,525 INFO L794 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 779#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 793#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 794#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 782#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 773#L12-2 28.22/13.10 [2019-03-28 22:39:05,526 INFO L796 eck$LassoCheckResult]: Loop: 773#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 775#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 798#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 797#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 795#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 786#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 783#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 782#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 773#L12-2 28.22/13.10 [2019-03-28 22:39:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 5 times 28.22/13.10 [2019-03-28 22:39:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1295692375, now seen corresponding path program 3 times 28.22/13.10 [2019-03-28 22:39:05,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:05,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:05,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.22/13.10 [2019-03-28 22:39:05,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 28.22/13.10 [2019-03-28 22:39:05,557 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.22/13.10 [2019-03-28 22:39:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 28.22/13.10 [2019-03-28 22:39:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 28.22/13.10 [2019-03-28 22:39:05,557 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. cyclomatic complexity: 17 Second operand 4 states. 28.22/13.10 [2019-03-28 22:39:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.22/13.10 [2019-03-28 22:39:05,567 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. 28.22/13.10 [2019-03-28 22:39:05,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 28.22/13.10 [2019-03-28 22:39:05,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. 28.22/13.10 [2019-03-28 22:39:05,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 28.22/13.10 [2019-03-28 22:39:05,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:05,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 28.22/13.10 [2019-03-28 22:39:05,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 28.22/13.10 [2019-03-28 22:39:05,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:05,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:05,571 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. 28.22/13.10 [2019-03-28 22:39:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 28.22/13.10 [2019-03-28 22:39:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. 28.22/13.10 [2019-03-28 22:39:05,575 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. 28.22/13.10 [2019-03-28 22:39:05,575 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. 28.22/13.10 [2019-03-28 22:39:05,575 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 28.22/13.10 [2019-03-28 22:39:05,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. 28.22/13.10 [2019-03-28 22:39:05,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 28.22/13.10 [2019-03-28 22:39:05,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.10 [2019-03-28 22:39:05,576 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.10 [2019-03-28 22:39:05,577 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] 28.22/13.10 [2019-03-28 22:39:05,577 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 7, 5] 28.22/13.10 [2019-03-28 22:39:05,577 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 883#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 906#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 892#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 887#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 877#L12-2 28.22/13.10 [2019-03-28 22:39:05,578 INFO L796 eck$LassoCheckResult]: Loop: 877#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 879#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 912#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 911#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 909#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 908#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 907#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 905#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 904#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 901#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 903#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 902#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 900#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 899#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 898#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 897#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 896#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 895#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 894#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 893#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 891#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 889#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 890#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 886#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 877#L12-2 28.22/13.10 [2019-03-28 22:39:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 6 times 28.22/13.10 [2019-03-28 22:39:05,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:05,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1147706558, now seen corresponding path program 4 times 28.22/13.10 [2019-03-28 22:39:05,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:05,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 371039752, now seen corresponding path program 5 times 28.22/13.10 [2019-03-28 22:39:05,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:05,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 28.22/13.10 [2019-03-28 22:39:05,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 28.22/13.10 [2019-03-28 22:39:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 28.22/13.10 [2019-03-28 22:39:05,709 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) 28.22/13.10 [2019-03-28 22:39:05,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:05,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:05,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:05,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 28.22/13.10 [2019-03-28 22:39:05,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 17 28.22/13.10 [2019-03-28 22:39:06,111 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 28.22/13.10 [2019-03-28 22:39:06,128 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:06,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:06,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:06,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:06,128 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.10 [2019-03-28 22:39:06,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:06,129 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:06,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 28.22/13.10 [2019-03-28 22:39:06,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:06,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:06,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,203 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:06,204 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:06,212 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 [2019-03-28 22:39:06,241 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.10 [2019-03-28 22:39:06,241 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:06,247 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 [2019-03-28 22:39:06,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.22/13.10 [2019-03-28 22:39:06,275 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:06,285 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:06,315 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 [2019-03-28 22:39:06,387 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.10 [2019-03-28 22:39:06,389 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:06,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:06,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:06,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:06,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.10 [2019-03-28 22:39:06,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:06,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:06,390 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:06,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 28.22/13.10 [2019-03-28 22:39:06,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:06,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:06,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:06,445 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:06,446 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.10 [2019-03-28 22:39:06,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.10 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.10 Number of strict supporting invariants: 0 28.22/13.10 Number of non-strict supporting invariants: 1 28.22/13.10 Consider only non-deceasing supporting invariants: true 28.22/13.10 Simplify termination arguments: true 28.22/13.10 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.10 [2019-03-28 22:39:06,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.10 [2019-03-28 22:39:06,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.10 [2019-03-28 22:39:06,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.10 [2019-03-28 22:39:06,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.10 [2019-03-28 22:39:06,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.22/13.10 [2019-03-28 22:39:06,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.22/13.10 [2019-03-28 22:39:06,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.10 [2019-03-28 22:39:06,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.10 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.10 Number of strict supporting invariants: 0 28.22/13.10 Number of non-strict supporting invariants: 1 28.22/13.10 Consider only non-deceasing supporting invariants: true 28.22/13.10 Simplify termination arguments: true 28.22/13.10 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.10 [2019-03-28 22:39:06,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.10 [2019-03-28 22:39:06,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.10 [2019-03-28 22:39:06,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.10 [2019-03-28 22:39:06,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.10 [2019-03-28 22:39:06,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.22/13.10 [2019-03-28 22:39:06,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.22/13.10 [2019-03-28 22:39:06,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.22/13.10 [2019-03-28 22:39:06,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.10 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.10 Number of strict supporting invariants: 0 28.22/13.10 Number of non-strict supporting invariants: 1 28.22/13.10 Consider only non-deceasing supporting invariants: true 28.22/13.10 Simplify termination arguments: true 28.22/13.10 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.10 [2019-03-28 22:39:06,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.10 [2019-03-28 22:39:06,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.10 [2019-03-28 22:39:06,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.10 [2019-03-28 22:39:06,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.10 [2019-03-28 22:39:06,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.10 [2019-03-28 22:39:06,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.10 [2019-03-28 22:39:06,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.10 [2019-03-28 22:39:06,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.10 [2019-03-28 22:39:06,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.10 [2019-03-28 22:39:06,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.22/13.10 [2019-03-28 22:39:06,479 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.10 [2019-03-28 22:39:06,480 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.10 [2019-03-28 22:39:06,480 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.10 [2019-03-28 22:39:06,480 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.10 Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 28.22/13.10 Supporting invariants [] 28.22/13.10 [2019-03-28 22:39:06,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.10 [2019-03-28 22:39:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 72 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:06,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:06,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:07,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:07,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:07,359 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 23 predicates after loop cannibalization 28.22/13.10 [2019-03-28 22:39:07,359 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 23 loop predicates 28.22/13.10 [2019-03-28 22:39:07,359 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 7 states. 28.22/13.10 [2019-03-28 22:39:08,340 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 861 states and 948 transitions. Complement of second has 218 states. 28.22/13.10 [2019-03-28 22:39:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 20 non-accepting loop states 3 accepting loop states 28.22/13.10 [2019-03-28 22:39:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 28.22/13.10 [2019-03-28 22:39:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. 28.22/13.10 [2019-03-28 22:39:08,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 24 letters. 28.22/13.10 [2019-03-28 22:39:08,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:08,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 29 letters. Loop has 24 letters. 28.22/13.10 [2019-03-28 22:39:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:08,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 48 letters. 28.22/13.10 [2019-03-28 22:39:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:08,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 948 transitions. 28.22/13.10 [2019-03-28 22:39:08,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 28.22/13.10 [2019-03-28 22:39:08,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 66 states and 74 transitions. 28.22/13.10 [2019-03-28 22:39:08,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 28.22/13.10 [2019-03-28 22:39:08,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 28.22/13.10 [2019-03-28 22:39:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. 28.22/13.10 [2019-03-28 22:39:08,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:08,365 INFO L706 BuchiCegarLoop]: Abstraction has 66 states and 74 transitions. 28.22/13.10 [2019-03-28 22:39:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. 28.22/13.10 [2019-03-28 22:39:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 30. 28.22/13.10 [2019-03-28 22:39:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 28.22/13.10 [2019-03-28 22:39:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. 28.22/13.10 [2019-03-28 22:39:08,368 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. 28.22/13.10 [2019-03-28 22:39:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 28.22/13.10 [2019-03-28 22:39:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 28.22/13.10 [2019-03-28 22:39:08,369 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 17 states. 28.22/13.10 [2019-03-28 22:39:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.22/13.10 [2019-03-28 22:39:08,561 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. 28.22/13.10 [2019-03-28 22:39:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 28.22/13.10 [2019-03-28 22:39:08,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 114 transitions. 28.22/13.10 [2019-03-28 22:39:08,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 28.22/13.10 [2019-03-28 22:39:08,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 48 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:08,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 28.22/13.10 [2019-03-28 22:39:08,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 28.22/13.10 [2019-03-28 22:39:08,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:08,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.22/13.10 [2019-03-28 22:39:08,565 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 55 transitions. 28.22/13.10 [2019-03-28 22:39:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. 28.22/13.10 [2019-03-28 22:39:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 28.22/13.10 [2019-03-28 22:39:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. 28.22/13.10 [2019-03-28 22:39:08,568 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. 28.22/13.10 [2019-03-28 22:39:08,568 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. 28.22/13.10 [2019-03-28 22:39:08,569 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 28.22/13.10 [2019-03-28 22:39:08,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. 28.22/13.10 [2019-03-28 22:39:08,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 28.22/13.10 [2019-03-28 22:39:08,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.22/13.10 [2019-03-28 22:39:08,569 INFO L119 BuchiIsEmpty]: Starting construction of run 28.22/13.10 [2019-03-28 22:39:08,570 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1] 28.22/13.10 [2019-03-28 22:39:08,570 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] 28.22/13.10 [2019-03-28 22:39:08,570 INFO L794 eck$LassoCheckResult]: Stem: 3956#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3957#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3971#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3970#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3969#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3968#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3963#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3965#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3978#L12 28.22/13.10 [2019-03-28 22:39:08,571 INFO L796 eck$LassoCheckResult]: Loop: 3978#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3977#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3976#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3975#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3974#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3952#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3953#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3983#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3980#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3981#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3982#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3954#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3955#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3960#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3979#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3959#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3973#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3972#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3966#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3967#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3961#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3962#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3978#L12 28.22/13.10 [2019-03-28 22:39:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1949671769, now seen corresponding path program 7 times 28.22/13.10 [2019-03-28 22:39:08,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:08,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 19520071, now seen corresponding path program 5 times 28.22/13.10 [2019-03-28 22:39:08,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1948051347, now seen corresponding path program 6 times 28.22/13.10 [2019-03-28 22:39:08,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.22/13.10 [2019-03-28 22:39:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.22/13.10 [2019-03-28 22:39:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.22/13.10 [2019-03-28 22:39:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.22/13.10 [2019-03-28 22:39:08,799 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 28.22/13.10 [2019-03-28 22:39:08,809 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:08,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:08,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:08,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:08,810 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.22/13.10 [2019-03-28 22:39:08,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:08,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:08,810 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:08,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 28.22/13.10 [2019-03-28 22:39:08,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:08,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:08,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,861 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:08,861 INFO L412 LassoAnalysis]: Checking for nontermination... 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:08,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:08,865 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.22/13.10 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.22/13.10 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:08,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.22/13.10 [2019-03-28 22:39:08,895 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.22/13.10 [2019-03-28 22:39:08,970 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.22/13.10 [2019-03-28 22:39:08,972 INFO L216 LassoAnalysis]: Preferences: 28.22/13.10 [2019-03-28 22:39:08,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.22/13.10 [2019-03-28 22:39:08,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.22/13.10 [2019-03-28 22:39:08,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.22/13.10 [2019-03-28 22:39:08,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.22/13.10 [2019-03-28 22:39:08,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.22/13.10 [2019-03-28 22:39:08,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.22/13.10 [2019-03-28 22:39:08,973 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.22/13.10 [2019-03-28 22:39:08,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 28.22/13.10 [2019-03-28 22:39:08,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.22/13.10 [2019-03-28 22:39:08,973 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.22/13.10 [2019-03-28 22:39:08,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:08,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.22/13.10 [2019-03-28 22:39:09,023 INFO L300 LassoAnalysis]: Preprocessing complete. 28.22/13.10 [2019-03-28 22:39:09,023 INFO L497 LassoAnalysis]: Using template 'affine'. 28.22/13.10 [2019-03-28 22:39:09,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.22/13.10 Termination analysis: LINEAR_WITH_GUESSES 28.22/13.10 Number of strict supporting invariants: 0 28.22/13.10 Number of non-strict supporting invariants: 1 28.22/13.10 Consider only non-deceasing supporting invariants: true 28.22/13.10 Simplify termination arguments: true 28.22/13.10 Simplify supporting invariants: trueOverapproximate stem: false 28.22/13.10 [2019-03-28 22:39:09,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.22/13.10 [2019-03-28 22:39:09,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.22/13.10 [2019-03-28 22:39:09,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.22/13.10 [2019-03-28 22:39:09,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.22/13.10 [2019-03-28 22:39:09,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.22/13.10 [2019-03-28 22:39:09,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.22/13.10 [2019-03-28 22:39:09,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.22/13.10 [2019-03-28 22:39:09,028 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.22/13.10 [2019-03-28 22:39:09,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.22/13.10 [2019-03-28 22:39:09,030 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.22/13.10 [2019-03-28 22:39:09,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.22/13.10 [2019-03-28 22:39:09,030 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.22/13.10 [2019-03-28 22:39:09,030 INFO L518 LassoAnalysis]: Proved termination. 28.22/13.10 [2019-03-28 22:39:09,030 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.22/13.10 Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 28.22/13.10 Supporting invariants [] 28.22/13.10 [2019-03-28 22:39:09,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.22/13.10 [2019-03-28 22:39:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.22/13.10 [2019-03-28 22:39:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 53 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. 28.22/13.10 [2019-03-28 22:39:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.22/13.10 [2019-03-28 22:39:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core 28.22/13.10 [2019-03-28 22:39:09,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.22/13.10 [2019-03-28 22:39:09,895 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization 28.22/13.10 [2019-03-28 22:39:09,895 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 8 loop predicates 28.22/13.10 [2019-03-28 22:39:09,896 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 36 transitions. cyclomatic complexity: 6 Second operand 7 states. 28.22/13.10 [2019-03-28 22:39:10,012 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 36 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 116 states and 136 transitions. Complement of second has 24 states. 28.22/13.10 [2019-03-28 22:39:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 28.22/13.10 [2019-03-28 22:39:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 28.22/13.10 [2019-03-28 22:39:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. 28.22/13.10 [2019-03-28 22:39:10,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 22 letters. 28.22/13.10 [2019-03-28 22:39:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 30 letters. Loop has 22 letters. 28.22/13.10 [2019-03-28 22:39:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 44 letters. 28.22/13.10 [2019-03-28 22:39:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.22/13.10 [2019-03-28 22:39:10,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 136 transitions. 28.22/13.10 [2019-03-28 22:39:10,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.22/13.10 [2019-03-28 22:39:10,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 28.22/13.10 [2019-03-28 22:39:10,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 28.22/13.10 [2019-03-28 22:39:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,022 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 28.22/13.10 [2019-03-28 22:39:10,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 28.22/13.10 [2019-03-28 22:39:10,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.22/13.10 [2019-03-28 22:39:10,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 28.22/13.10 [2019-03-28 22:39:10,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:10 BasicIcfg 28.22/13.10 [2019-03-28 22:39:10,030 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 28.22/13.10 [2019-03-28 22:39:10,031 INFO L168 Benchmark]: Toolchain (without parser) took 8554.24 ms. Allocated memory was 649.6 MB in the beginning and 861.4 MB in the end (delta: 211.8 MB). Free memory was 564.9 MB in the beginning and 814.1 MB in the end (delta: -249.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,031 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. 28.22/13.10 [2019-03-28 22:39:10,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.28 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.98 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 555.5 MB in the beginning and 647.8 MB in the end (delta: -92.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,033 INFO L168 Benchmark]: Boogie Preprocessor took 19.68 ms. Allocated memory is still 683.1 MB. Free memory is still 647.8 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,033 INFO L168 Benchmark]: RCFGBuilder took 208.25 ms. Allocated memory is still 683.1 MB. Free memory was 647.8 MB in the beginning and 634.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,034 INFO L168 Benchmark]: BlockEncodingV2 took 78.45 ms. Allocated memory is still 683.1 MB. Free memory was 634.8 MB in the beginning and 628.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,034 INFO L168 Benchmark]: TraceAbstraction took 169.08 ms. Allocated memory is still 683.1 MB. Free memory was 628.4 MB in the beginning and 618.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,035 INFO L168 Benchmark]: BuchiAutomizer took 7758.27 ms. Allocated memory was 683.1 MB in the beginning and 861.4 MB in the end (delta: 178.3 MB). Free memory was 618.9 MB in the beginning and 814.1 MB in the end (delta: -195.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.22/13.10 [2019-03-28 22:39:10,038 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 28.22/13.10 --- Results --- 28.22/13.10 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 28.22/13.10 - StatisticsResult: Initial Icfg 28.22/13.10 7 locations, 9 edges 28.22/13.10 - StatisticsResult: Encoded RCFG 28.22/13.10 3 locations, 4 edges 28.22/13.10 * Results from de.uni_freiburg.informatik.ultimate.core: 28.22/13.10 - StatisticsResult: Toolchain Benchmarks 28.22/13.10 Benchmark results are: 28.22/13.10 * 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. 28.22/13.10 * CACSL2BoogieTranslator took 224.28 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 28.22/13.10 * Boogie Procedure Inliner took 90.98 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 555.5 MB in the beginning and 647.8 MB in the end (delta: -92.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. 28.22/13.10 * Boogie Preprocessor took 19.68 ms. Allocated memory is still 683.1 MB. Free memory is still 647.8 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.22/13.10 * RCFGBuilder took 208.25 ms. Allocated memory is still 683.1 MB. Free memory was 647.8 MB in the beginning and 634.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 28.22/13.10 * BlockEncodingV2 took 78.45 ms. Allocated memory is still 683.1 MB. Free memory was 634.8 MB in the beginning and 628.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 28.22/13.10 * TraceAbstraction took 169.08 ms. Allocated memory is still 683.1 MB. Free memory was 628.4 MB in the beginning and 618.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 28.22/13.10 * BuchiAutomizer took 7758.27 ms. Allocated memory was 683.1 MB in the beginning and 861.4 MB in the end (delta: 178.3 MB). Free memory was 618.9 MB in the beginning and 814.1 MB in the end (delta: -195.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.22/13.10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 28.22/13.10 - AllSpecificationsHoldResult: All specifications hold 28.22/13.10 We were not able to verify any specifiation because the program does not contain any specification. 28.22/13.10 - InvariantResult [Line: 11]: Loop Invariant 28.22/13.10 Derived loop invariant: 1 28.22/13.10 - StatisticsResult: Ultimate Automizer benchmark data 28.22/13.10 CFG has 1 procedures, 3 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=3occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 28.22/13.10 - StatisticsResult: Constructed decomposition of program 28.22/13.10 Your program was decomposed into 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function c and consists of 25 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. 28.22/13.10 - StatisticsResult: Timing statistics 28.22/13.10 BüchiAutomizer plugin needed 7.7s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 93 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 206/264 HoareTripleCheckerStatistics: 37 SDtfs, 75 SDslu, 33 SDs, 0 SdLazy, 291 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp97 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 28.22/13.10 - TerminationAnalysisResult: Termination proven 28.22/13.10 Buchi Automizer proved that your program is terminating 28.22/13.10 RESULT: Ultimate proved your program to be correct! 28.22/13.10 !SESSION 2019-03-28 22:38:58.194 ----------------------------------------------- 28.22/13.10 eclipse.buildId=unknown 28.22/13.10 java.version=1.8.0_181 28.22/13.10 java.vendor=Oracle Corporation 28.22/13.10 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 28.22/13.10 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.22/13.10 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 28.22/13.10 28.22/13.10 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:39:10.272 28.22/13.10 !MESSAGE The workspace will exit with unsaved changes in this session. 28.22/13.10 Received shutdown request... 28.22/13.10 Ultimate: 28.22/13.10 GTK+ Version Check 28.22/13.10 EOF