./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac73664c6b6c540fa41a6c75f0a1d02ae5fcc2e0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:41:06,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:41:06,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:41:06,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:41:06,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:41:06,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:41:06,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:41:06,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:41:06,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:41:06,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:41:06,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:41:06,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:41:06,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:41:06,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:41:06,507 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:41:06,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:41:06,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:41:06,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:41:06,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:41:06,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:41:06,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:41:06,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:41:06,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:41:06,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:41:06,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:41:06,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:41:06,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:41:06,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:41:06,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:41:06,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:41:06,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:41:06,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:41:06,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:41:06,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:41:06,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:41:06,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:41:06,540 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:41:06,566 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:41:06,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:41:06,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:41:06,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:41:06,568 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:41:06,569 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:41:06,569 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:41:06,569 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:41:06,569 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:41:06,569 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:41:06,569 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:41:06,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:41:06,570 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:41:06,570 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:41:06,570 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:41:06,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:41:06,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:41:06,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:41:06,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:41:06,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:41:06,572 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:41:06,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:41:06,573 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:41:06,573 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:41:06,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:41:06,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:41:06,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:41:06,574 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:41:06,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:41:06,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:41:06,574 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:41:06,575 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:41:06,576 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac73664c6b6c540fa41a6c75f0a1d02ae5fcc2e0 [2019-01-14 03:41:06,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:41:06,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:41:06,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:41:06,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:41:06,627 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:41:06,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i [2019-01-14 03:41:06,682 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba290877/118d786676b1452bbe4982fb85384378/FLAGcdbbb05c4 [2019-01-14 03:41:07,072 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:41:07,073 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i [2019-01-14 03:41:07,078 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba290877/118d786676b1452bbe4982fb85384378/FLAGcdbbb05c4 [2019-01-14 03:41:07,461 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba290877/118d786676b1452bbe4982fb85384378 [2019-01-14 03:41:07,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:41:07,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:41:07,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:41:07,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:41:07,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:41:07,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c850f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07, skipping insertion in model container [2019-01-14 03:41:07,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:41:07,508 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:41:07,718 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:41:07,726 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:41:07,754 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:41:07,773 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:41:07,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07 WrapperNode [2019-01-14 03:41:07,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:41:07,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:41:07,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:41:07,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:41:07,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:41:07,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:41:07,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:41:07,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:41:07,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... [2019-01-14 03:41:07,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:41:07,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:41:07,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:41:07,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:41:07,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:41:08,432 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:41:08,433 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-14 03:41:08,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:41:08 BoogieIcfgContainer [2019-01-14 03:41:08,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:41:08,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:41:08,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:41:08,438 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:41:08,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:41:08,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:41:07" (1/3) ... [2019-01-14 03:41:08,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@166a79c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:41:08, skipping insertion in model container [2019-01-14 03:41:08,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:41:08,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:41:07" (2/3) ... [2019-01-14 03:41:08,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@166a79c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:41:08, skipping insertion in model container [2019-01-14 03:41:08,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:41:08,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:41:08" (3/3) ... [2019-01-14 03:41:08,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG trex01_true-unreach-call_true-termination.i [2019-01-14 03:41:08,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:41:08,496 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:41:08,496 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:41:08,496 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:41:08,496 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:41:08,497 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:41:08,497 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:41:08,497 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:41:08,497 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:41:08,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-14 03:41:08,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:41:08,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:08,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:08,542 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:41:08,542 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:41:08,543 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:41:08,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-14 03:41:08,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:41:08,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:08,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:08,547 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:41:08,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:41:08,555 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 15#L36true assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 28#L13true assume !!(f_~k~0 <= 1073741823); 13#L16-2true [2019-01-14 03:41:08,555 INFO L796 eck$LassoCheckResult]: Loop: 13#L16-2true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 13#L16-2true [2019-01-14 03:41:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 30886, now seen corresponding path program 1 times [2019-01-14 03:41:08,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:08,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 03:41:08,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:08,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 957485, now seen corresponding path program 1 times [2019-01-14 03:41:08,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,829 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:08,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:08,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:08,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:08,831 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:41:08,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:08,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:08,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:08,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 03:41:08,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:08,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:08,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41: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 [2019-01-14 03:41:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:09,511 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,526 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,526 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,590 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,644 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,666 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-191} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:09,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:09,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:09,766 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:09,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:41:09,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:21,860 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:41:21,866 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:21,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:21,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:21,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:21,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:21,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:21,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:21,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:21,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 03:41:21,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:21,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:21,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:22,421 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 03:41:22,872 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:22,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:22,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:22,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:22,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:22,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:22,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:22,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:22,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:22,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:22,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:22,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:22,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:22,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:22,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:22,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:22,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:22,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:22,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:22,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:22,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:22,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:22,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:22,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:22,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:22,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:22,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:22,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:23,044 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:41:23,045 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:41:23,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:23,051 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:41:23,052 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:23,054 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-14 03:41:23,087 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:41:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:23,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:23,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:23,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 03:41:23,297 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-01-14 03:41:23,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 84 states and 128 transitions. Complement of second has 7 states. [2019-01-14 03:41:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2019-01-14 03:41:23,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 03:41:23,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:23,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 03:41:23,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:23,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 03:41:23,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:23,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 128 transitions. [2019-01-14 03:41:23,459 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-01-14 03:41:23,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 29 states and 37 transitions. [2019-01-14 03:41:23,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:41:23,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:41:23,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-14 03:41:23,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:41:23,467 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-14 03:41:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-14 03:41:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-14 03:41:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 03:41:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 03:41:23,497 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 03:41:23,497 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 03:41:23,497 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:41:23,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 03:41:23,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-14 03:41:23,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:23,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:23,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:41:23,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:41:23,499 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 172#L36 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 174#L13-1 assume !!(f_~k~0 <= 1073741823); 168#L16-6 [2019-01-14 03:41:23,499 INFO L796 eck$LassoCheckResult]: Loop: 168#L16-6 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 168#L16-6 [2019-01-14 03:41:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash 32998, now seen corresponding path program 1 times [2019-01-14 03:41:23,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:23,512 INFO L82 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2019-01-14 03:41:23,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:23,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1023023, now seen corresponding path program 1 times [2019-01-14 03:41:23,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:23,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:23,598 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:23,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:23,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:23,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:23,598 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:41:23,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:23,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:23,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:23,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 03:41:23,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:23,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:23,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:23,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:23,912 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:23,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:23,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:23,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:23,921 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:23,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:23,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:23,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:23,957 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:23,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:23,981 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:23,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:23,984 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:24,007 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:24,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:24,010 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:24,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:24,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:24,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:24,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:24,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:24,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:24,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:24,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:24,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~d=0, ULTIMATE.start_f_#in~d=0} Honda state: {ULTIMATE.start_f_~d=2, ULTIMATE.start_f_#in~d=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:24,115 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:24,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:41:24,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:37,781 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:41:37,787 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:37,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:37,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:37,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:37,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:37,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:37,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:37,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:37,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 03:41:37,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:37,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:37,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:37,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:37,956 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:37,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:37,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:37,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:37,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:37,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:37,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:37,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:37,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:37,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:37,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:37,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:37,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:37,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:37,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:37,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:37,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:37,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:37,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:37,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:37,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:37,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:37,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:37,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:37,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:37,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:37,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:37,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:37,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:37,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:37,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:37,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:37,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:37,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:37,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:38,028 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:38,053 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 03:41:38,053 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:41:38,054 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:38,055 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:41:38,055 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:38,056 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~k~0, ULTIMATE.start_f_~z~0) = 1*ULTIMATE.start_f_~k~0 - 1*ULTIMATE.start_f_~z~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-14 03:41:38,074 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:41:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:38,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:38,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:38,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 03:41:38,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 03:41:38,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 38 states and 49 transitions. Complement of second has 6 states. [2019-01-14 03:41:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-14 03:41:38,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 03:41:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:38,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 03:41:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:38,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 03:41:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:38,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-01-14 03:41:38,251 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-14 03:41:38,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 39 transitions. [2019-01-14 03:41:38,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:41:38,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:41:38,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-14 03:41:38,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:41:38,255 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 03:41:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-14 03:41:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 03:41:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 03:41:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-01-14 03:41:38,257 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-14 03:41:38,257 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-14 03:41:38,257 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:41:38,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-01-14 03:41:38,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:41:38,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:38,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:38,259 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:38,259 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:38,259 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 277#L36 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 281#L13 assume !!(f_~k~0 <= 1073741823); 282#L16-2 assume !(f_~z~0 < f_~k~0); 283#L16-3 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 284#L4 assume !(0 == __VERIFIER_assert_~cond); 280#L4-2 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 269#L20 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 270#L21 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 275#L24-2 [2019-01-14 03:41:38,260 INFO L796 eck$LassoCheckResult]: Loop: 275#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 278#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 275#L24-2 [2019-01-14 03:41:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1466276473, now seen corresponding path program 1 times [2019-01-14 03:41:38,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:38,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 1 times [2019-01-14 03:41:38,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:38,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:38,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash 342419296, now seen corresponding path program 1 times [2019-01-14 03:41:38,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:38,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:38,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:38,421 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:41:38,582 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:38,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:38,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:38,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:38,583 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:41:38,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:38,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:38,583 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:38,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-14 03:41:38,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:38,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:38,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:38,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:38,864 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:38,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:38,869 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:38,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:41:38,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:50,941 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:41:50,944 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:50,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:50,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:50,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:50,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:50,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:50,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:50,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:50,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-14 03:41:50,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:50,945 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:50,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:50,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:51,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:51,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:51,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:51,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:51,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:51,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:51,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:51,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:51,245 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:51,258 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:41:51,258 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:41:51,259 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:51,260 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:41:51,260 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:51,260 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 03:41:51,287 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:41:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:51,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:51,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:51,451 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:41:51,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 03:41:51,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 30 states and 39 transitions. Complement of second has 6 states. [2019-01-14 03:41:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:41:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-14 03:41:51,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 03:41:51,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:51,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 03:41:51,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:51,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 03:41:51,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:51,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-14 03:41:51,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:41:51,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2019-01-14 03:41:51,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 03:41:51,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 03:41:51,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-14 03:41:51,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:51,510 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 03:41:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-14 03:41:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 03:41:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:41:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-14 03:41:51,513 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 03:41:51,513 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 03:41:51,514 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:41:51,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-14 03:41:51,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:41:51,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:51,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:51,516 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:51,516 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:51,516 INFO L794 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 396#L36 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 402#L13-1 assume !!(f_~k~0 <= 1073741823); 391#L16-6 assume !(f_~z~0 < f_~k~0); 386#L16-7 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 387#L4-3 assume !(0 == __VERIFIER_assert_~cond); 390#L4-5 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 382#L20-2 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 383#L21-2 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 384#L24-5 [2019-01-14 03:41:51,517 INFO L796 eck$LassoCheckResult]: Loop: 384#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 385#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 384#L24-5 [2019-01-14 03:41:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 925850489, now seen corresponding path program 1 times [2019-01-14 03:41:51,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:51,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:51,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 1 times [2019-01-14 03:41:51,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 684093600, now seen corresponding path program 1 times [2019-01-14 03:41:51,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:51,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:51,829 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-14 03:41:51,831 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:51,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:51,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:51,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:51,831 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:41:51,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:51,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:51,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:51,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-14 03:41:51,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:51,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:51,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:51,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:52,200 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:52,200 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:52,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:52,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:52,207 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:52,207 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:52,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:52,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:52,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:52,255 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-256, ULTIMATE.start_f_~c~0=-256} Honda state: {ULTIMATE.start_f_#t~nondet3=-256, ULTIMATE.start_f_~c~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:52,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:52,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:41:52,287 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:41:52,287 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:52,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:41:52,308 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:52,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:41:52,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:04,376 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:42:04,379 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:04,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:04,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:04,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:04,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:42:04,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:04,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:04,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:04,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-14 03:42:04,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:04,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:04,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:04,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:04,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:42:04,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:04,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:04,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:04,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:04,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:04,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:04,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:04,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:04,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:04,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:04,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:04,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:04,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:04,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:04,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:04,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:04,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:04,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:04,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:04,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:04,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:04,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:04,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:04,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:04,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:04,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:04,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:04,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:04,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:04,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:04,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:04,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:04,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:04,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:04,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:04,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:04,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:04,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:04,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:04,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:04,768 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:42:04,772 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:42:04,773 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:42:04,773 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:42:04,774 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:42:04,775 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:42:04,775 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 03:42:04,800 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:42:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:04,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:04,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:42:04,974 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:42:04,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 03:42:05,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 37 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 34 states and 45 transitions. Complement of second has 6 states. [2019-01-14 03:42:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:42:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:42:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-14 03:42:05,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 03:42:05,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:05,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 03:42:05,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:05,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 03:42:05,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:05,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2019-01-14 03:42:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:42:05,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 44 transitions. [2019-01-14 03:42:05,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:42:05,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 03:42:05,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-01-14 03:42:05,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:42:05,031 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-14 03:42:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-01-14 03:42:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-14 03:42:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 03:42:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-01-14 03:42:05,036 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-14 03:42:05,036 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-14 03:42:05,036 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:42:05,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-01-14 03:42:05,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:42:05,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:42:05,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:42:05,037 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:42:05,037 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:42:05,038 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 527#L36 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 535#L13 assume !!(f_~k~0 <= 1073741823); 536#L16-2 assume !(f_~z~0 < f_~k~0); 537#L16-3 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 538#L4 assume !(0 == __VERIFIER_assert_~cond); 534#L4-2 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 519#L20 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 520#L21 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 524#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 532#L24 assume 0 != f_~c~0 % 256; 539#L25 [2019-01-14 03:42:05,038 INFO L796 eck$LassoCheckResult]: Loop: 539#L25 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 528#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 529#L24 assume 0 != f_~c~0 % 256; 539#L25 [2019-01-14 03:42:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 342419292, now seen corresponding path program 1 times [2019-01-14 03:42:05,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:05,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash 91200, now seen corresponding path program 1 times [2019-01-14 03:42:05,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:05,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 465861381, now seen corresponding path program 1 times [2019-01-14 03:42:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:05,137 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:05,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:05,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:05,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:05,138 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:05,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:05,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:05,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-14 03:42:05,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:05,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:05,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:05,293 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:05,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:05,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:05,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:05,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:05,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:05,342 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=-1, ULTIMATE.start_f_~y~0=255} Honda state: {ULTIMATE.start_f_#t~nondet4=-1, ULTIMATE.start_f_~y~0=255} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:05,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:05,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:05,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:05,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:05,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:05,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:05,429 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Honda state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 03:42:05,637 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:05,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:05,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:05,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:05,638 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:05,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:05,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:05,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:05,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-14 03:42:05,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:05,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:05,972 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 03:42:06,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:06,470 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 03:42:06,699 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:06,699 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:06,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:06,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:06,713 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:06,714 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:06,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:06,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:06,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:06,737 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:06,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:06,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:06,780 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:06,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0, ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_#t~nondet4=255, ULTIMATE.start_f_~y~0=255} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:06,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:06,802 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:06,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:06,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:18,966 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:42:18,969 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:18,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:18,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:18,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:18,970 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:42:18,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:18,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:18,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:18,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-14 03:42:18,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:18,971 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:18,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:18,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:19,261 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:42:19,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:19,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:19,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:19,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:19,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:19,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:19,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:19,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:19,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:19,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:19,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:19,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:19,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:19,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:19,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:19,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:19,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:19,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:19,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:19,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:19,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:19,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:19,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:19,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:19,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:42:19,295 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 03:42:19,295 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:42:19,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:42:19,299 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:42:19,299 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:42:19,299 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 03:42:19,319 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:42:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:19,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:19,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:42:19,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 03:42:19,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-14 03:42:19,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 7 states. [2019-01-14 03:42:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:42:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:42:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-14 03:42:19,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 03:42:19,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:19,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:42:19,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:19,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 03:42:19,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:19,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-01-14 03:42:19,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 03:42:19,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 51 transitions. [2019-01-14 03:42:19,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:42:19,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 03:42:19,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-01-14 03:42:19,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:42:19,476 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-01-14 03:42:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-01-14 03:42:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-14 03:42:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 03:42:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2019-01-14 03:42:19,482 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-14 03:42:19,482 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-14 03:42:19,482 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:42:19,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2019-01-14 03:42:19,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 03:42:19,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:42:19,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:42:19,483 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:42:19,483 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:42:19,487 INFO L794 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 678#L36 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 683#L13-1 assume !!(f_~k~0 <= 1073741823); 673#L16-6 assume !(f_~z~0 < f_~k~0); 668#L16-7 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 669#L4-3 assume !(0 == __VERIFIER_assert_~cond); 672#L4-5 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 660#L20-2 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 661#L21-2 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 667#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 666#L24-3 assume 0 != f_~c~0 % 256; 675#L25-1 [2019-01-14 03:42:19,487 INFO L796 eck$LassoCheckResult]: Loop: 675#L25-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 662#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 663#L24-3 assume 0 != f_~c~0 % 256; 675#L25-1 [2019-01-14 03:42:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 684093596, now seen corresponding path program 1 times [2019-01-14 03:42:19,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 156738, now seen corresponding path program 1 times [2019-01-14 03:42:19,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:19,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 212625863, now seen corresponding path program 1 times [2019-01-14 03:42:19,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:19,598 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:19,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:19,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:19,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:19,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:19,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:19,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:19,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-14 03:42:19,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:19,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:19,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:19,772 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:19,773 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:19,779 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:19,788 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:19,788 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=128, ULTIMATE.start_f_~c~0=128} Honda state: {ULTIMATE.start_f_#t~nondet3=128, ULTIMATE.start_f_~c~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:19,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:19,828 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:19,828 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:19,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:19,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:19,846 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=-192, ULTIMATE.start_f_~y~0=64} Honda state: {ULTIMATE.start_f_#t~nondet4=-192, ULTIMATE.start_f_~y~0=64} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:19,865 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:19,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:19,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:19,901 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:19,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] [2019-01-14 03:42:20,072 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:20,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:20,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:20,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:20,073 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:20,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:20,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:20,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:20,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-14 03:42:20,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:20,074 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:20,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:20,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:20,377 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:20,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:20,382 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:20,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:20,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:33,011 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:42:33,015 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:33,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:33,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:33,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:33,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:42:33,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:33,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:33,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:33,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-14 03:42:33,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:33,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:33,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:33,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:33,297 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:42:33,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:33,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:33,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:33,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:33,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:33,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:33,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:33,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:42:33,319 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:42:33,319 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 03:42:33,320 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:42:33,321 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:42:33,321 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:42:33,321 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0) = 1*ULTIMATE.start_f_~x~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 03:42:33,347 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:42:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:33,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:33,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:42:33,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 03:42:33,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-01-14 03:42:33,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 47 states and 63 transitions. Complement of second has 7 states. [2019-01-14 03:42:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:42:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:42:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-14 03:42:33,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 03:42:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:33,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:42:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:33,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 03:42:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:33,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-01-14 03:42:33,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:42:33,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 43 states and 58 transitions. [2019-01-14 03:42:33,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:42:33,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 03:42:33,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2019-01-14 03:42:33,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:42:33,602 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-01-14 03:42:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2019-01-14 03:42:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-14 03:42:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 03:42:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2019-01-14 03:42:33,606 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-01-14 03:42:33,606 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-01-14 03:42:33,606 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:42:33,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2019-01-14 03:42:33,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:42:33,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:42:33,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:42:33,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:42:33,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:42:33,610 INFO L794 eck$LassoCheckResult]: Stem: 839#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 840#L36 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 849#L13 assume !!(f_~k~0 <= 1073741823); 850#L16-2 assume !(f_~z~0 < f_~k~0); 847#L16-3 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 848#L4 assume !(0 == __VERIFIER_assert_~cond); 846#L4-2 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 830#L20 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 831#L21 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 835#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 857#L24 assume 0 != f_~c~0 % 256; 855#L25 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 856#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 860#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 841#L24-2 [2019-01-14 03:42:33,610 INFO L796 eck$LassoCheckResult]: Loop: 841#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 842#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 841#L24-2 [2019-01-14 03:42:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 465861385, now seen corresponding path program 1 times [2019-01-14 03:42:33,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 2 times [2019-01-14 03:42:33,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:33,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1016194032, now seen corresponding path program 2 times [2019-01-14 03:42:33,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:33,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:33,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:42:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:33,819 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:42:33,955 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:42:34,359 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-14 03:42:34,422 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:34,422 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:34,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:34,422 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:34,422 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:34,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:34,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:34,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:34,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-14 03:42:34,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:34,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:34,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:34,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:34,764 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:34,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:34,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:34,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:34,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond=0, ULTIMATE.start___VERIFIER_assert_~cond=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond=1, ULTIMATE.start___VERIFIER_assert_~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:42:34,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:34,793 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:34,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:34,805 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0, ULTIMATE.start_f_~c~0=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0, ULTIMATE.start_f_~c~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:34,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:34,841 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:34,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:34,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:47,731 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:42:47,736 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:47,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:47,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:47,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:47,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:42:47,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:47,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:47,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:47,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-14 03:42:47,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:47,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:47,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:47,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:48,122 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:42:48,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:48,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:48,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:48,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:48,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:48,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:48,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:48,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:48,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:48,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:48,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:48,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:48,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:48,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:48,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:48,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:48,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:48,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:42:48,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:42:48,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:42:48,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:42:48,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:42:48,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:42:48,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:42:48,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:42:48,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:42:48,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:42:48,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:42:48,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:42:48,194 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:42:48,194 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:42:48,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:42:48,196 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:42:48,196 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:42:48,196 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 03:42:48,228 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:42:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:48,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:42:48,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:42:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:42:48,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:42:48,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 57 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-01-14 03:42:48,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 57 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 6 states. [2019-01-14 03:42:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:42:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:42:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-14 03:42:48,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 03:42:48,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:48,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:42:48,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:48,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 03:42:48,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:42:48,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-14 03:42:48,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:42:48,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 52 states and 69 transitions. [2019-01-14 03:42:48,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:42:48,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:42:48,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2019-01-14 03:42:48,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:42:48,561 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-01-14 03:42:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2019-01-14 03:42:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-01-14 03:42:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 03:42:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2019-01-14 03:42:48,564 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-01-14 03:42:48,564 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-01-14 03:42:48,565 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:42:48,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2019-01-14 03:42:48,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:42:48,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:42:48,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:42:48,566 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:42:48,566 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:42:48,566 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 1020#L36 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1025#L13-1 assume !!(f_~k~0 <= 1073741823); 1015#L16-6 assume !(f_~z~0 < f_~k~0); 1010#L16-7 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1011#L4-3 assume !(0 == __VERIFIER_assert_~cond); 1014#L4-5 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 1003#L20-2 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 1004#L21-2 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 1005#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1039#L24-3 assume 0 != f_~c~0 % 256; 1034#L25-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1035#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1042#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1006#L24-5 [2019-01-14 03:42:48,566 INFO L796 eck$LassoCheckResult]: Loop: 1006#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1007#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1006#L24-5 [2019-01-14 03:42:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash 212625867, now seen corresponding path program 1 times [2019-01-14 03:42:48,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:48,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:48,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:42:48,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 2 times [2019-01-14 03:42:48,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:42:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:42:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1824968078, now seen corresponding path program 2 times [2019-01-14 03:42:48,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:42:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:42:48,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:42:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:42:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:42:48,813 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-14 03:42:48,844 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:42:48,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:42:48,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:42:48,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:42:48,844 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:42:48,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:48,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:42:48,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:42:48,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-14 03:42:48,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:42:48,845 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:42:48,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:48,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:42:49,220 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:42:49,221 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,229 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=-1000000} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,255 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,287 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_~c~0=-256, ULTIMATE.start_f_#t~nondet3=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,310 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond=0, ULTIMATE.start___VERIFIER_assert_~cond=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond=1, ULTIMATE.start___VERIFIER_assert_~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,333 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,333 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,356 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,356 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:42:49,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:42:49,379 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:42:49,399 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:42:49,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:42:49,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:43:01,481 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:43:01,486 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:43:01,486 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:43:01,486 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:43:01,486 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:43:01,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:43:01,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:01,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:43:01,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:43:01,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-14 03:43:01,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:43:01,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:43:01,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:01,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:43:01,894 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:43:01,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:01,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:01,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:01,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:01,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:01,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:01,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:01,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:01,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:01,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:01,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:01,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:43:01,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:43:01,978 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:43:01,978 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:43:01,984 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:43:01,984 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:43:01,985 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 03:43:02,019 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:43:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:02,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:02,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:02,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:43:02,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 67 transitions. cyclomatic complexity: 27 Second operand 4 states. [2019-01-14 03:43:02,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 67 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 68 states and 89 transitions. Complement of second has 6 states. [2019-01-14 03:43:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:43:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:43:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-14 03:43:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 03:43:02,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:02,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:02,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 03:43:02,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:02,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2019-01-14 03:43:02,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:43:02,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 79 transitions. [2019-01-14 03:43:02,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 03:43:02,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:43:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-01-14 03:43:02,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:43:02,282 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-14 03:43:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-01-14 03:43:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-01-14 03:43:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 03:43:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-01-14 03:43:02,295 INFO L729 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-01-14 03:43:02,295 INFO L609 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-01-14 03:43:02,296 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:43:02,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2019-01-14 03:43:02,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:43:02,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:43:02,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:43:02,304 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:43:02,304 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:43:02,304 INFO L794 eck$LassoCheckResult]: Stem: 1220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 1221#L36 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1228#L13 assume !!(f_~k~0 <= 1073741823); 1229#L16-2 assume !(f_~z~0 < f_~k~0); 1230#L16-3 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1231#L4 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-2 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 1210#L20 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 1211#L21 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 1219#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1223#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1224#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1225#L24 assume 0 != f_~c~0 % 256; 1245#L25 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1244#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1241#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1240#L24-2 [2019-01-14 03:43:02,304 INFO L796 eck$LassoCheckResult]: Loop: 1240#L24-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1239#L24 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1240#L24-2 [2019-01-14 03:43:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1126180482, now seen corresponding path program 3 times [2019-01-14 03:43:02,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:02,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 3 times [2019-01-14 03:43:02,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:02,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash -72313559, now seen corresponding path program 4 times [2019-01-14 03:43:02,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:02,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:02,468 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:43:02,633 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-14 03:43:02,714 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:43:02,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:43:02,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:43:02,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:43:02,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:43:02,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:02,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:43:02,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:43:02,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 03:43:02,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:43:02,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:43:02,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:02,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:43:02,980 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:02,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:43:02,987 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:43:02,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:43:02,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=-1000000} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:03,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:43:03,012 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:03,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:43:03,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:43:15,125 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:43:15,129 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:43:15,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:43:15,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:43:15,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:43:15,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:43:15,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:15,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:43:15,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:43:15,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 03:43:15,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:43:15,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:43:15,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:15,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:43:15,480 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:43:15,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:15,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:15,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:15,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:15,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:15,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:15,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:15,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:15,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:15,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:15,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:15,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:15,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:15,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:15,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:15,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:15,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:15,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:15,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:15,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:15,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:15,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:15,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:15,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:15,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:15,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:15,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:15,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:43:15,561 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:43:15,562 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:43:15,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:43:15,563 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:43:15,563 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:43:15,563 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 03:43:15,591 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:43:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:16,068 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:43:16,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 03:43:16,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 66 states and 85 transitions. Complement of second has 6 states. [2019-01-14 03:43:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:43:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:43:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-14 03:43:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:16,110 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:43:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:16,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:43:16,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 03:43:16,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 66 states and 85 transitions. Complement of second has 6 states. [2019-01-14 03:43:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:43:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:43:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-14 03:43:16,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:16,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:16,242 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:43:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:16,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:16,391 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:43:16,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 03:43:16,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 69 states and 90 transitions. Complement of second has 5 states. [2019-01-14 03:43:16,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:43:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:43:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2019-01-14 03:43:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 18 letters. Loop has 2 letters. [2019-01-14 03:43:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-14 03:43:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:16,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2019-01-14 03:43:16,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:43:16,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 30 states and 39 transitions. [2019-01-14 03:43:16,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 03:43:16,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 03:43:16,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-14 03:43:16,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:43:16,437 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 03:43:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-14 03:43:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 03:43:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 03:43:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-14 03:43:16,439 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 03:43:16,439 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 03:43:16,440 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:43:16,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-14 03:43:16,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:43:16,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:43:16,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:43:16,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:43:16,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:43:16,443 INFO L794 eck$LassoCheckResult]: Stem: 1682#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 1683#L36 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1685#L13-1 assume !!(f_~k~0 <= 1073741823); 1675#L16-6 assume !(f_~z~0 < f_~k~0); 1676#L16-7 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1684#L4-3 assume !(0 == __VERIFIER_assert_~cond); 1673#L4-5 assume !!(f_~x~0 <= 1000000 && f_~x~0 >= -1000000); 1674#L20-2 assume !!(f_~y~0 <= 1000000 && f_~y~0 >= -1000000); 1686#L21-2 assume !!(f_~k~0 <= 1000000 && f_~k~0 >= -1000000); 1689#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1690#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1702#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1701#L24-3 assume 0 != f_~c~0 % 256; 1699#L25-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1698#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1696#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1695#L24-5 [2019-01-14 03:43:16,444 INFO L796 eck$LassoCheckResult]: Loop: 1695#L24-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1694#L24-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1695#L24-5 [2019-01-14 03:43:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1714981628, now seen corresponding path program 3 times [2019-01-14 03:43:16,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:16,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:16,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 3 times [2019-01-14 03:43:16,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:16,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1170101099, now seen corresponding path program 4 times [2019-01-14 03:43:16,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:43:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:43:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:43:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:43:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:43:16,633 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:43:16,758 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:43:16,987 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-14 03:43:17,138 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-14 03:43:17,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:43:17,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:43:17,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:43:17,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:43:17,141 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:43:17,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:17,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:43:17,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:43:17,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-14 03:43:17,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:43:17,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:43:17,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:17,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:43:17,422 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:17,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:43:17,427 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:17,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:43:17,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:43:31,078 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:43:31,083 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:43:31,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:43:31,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:43:31,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:43:31,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:43:31,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:43:31,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:43:31,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:43:31,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-14 03:43:31,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:43:31,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:43:31,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:43:31,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:43:31,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:43:31,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:31,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:31,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:31,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:31,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:31,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:31,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:31,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:31,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:31,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:31,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:31,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:31,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:43:31,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:43:31,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:43:31,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:43:31,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:43:31,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:43:31,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:43:31,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:43:31,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:43:31,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:43:31,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:43:31,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:43:31,509 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 03:43:31,509 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:43:31,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:43:31,515 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:43:31,515 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:43:31,516 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [499999*ULTIMATE.start_f_~d - 1*ULTIMATE.start_f_~x~0 >= 0] [2019-01-14 03:43:31,557 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:43:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:31,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:31,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:32,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-14 03:43:32,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-14 03:43:32,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 36 states and 46 transitions. Complement of second has 9 states. [2019-01-14 03:43:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 03:43:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:43:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-14 03:43:32,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:32,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:32,079 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:43:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:32,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:32,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:32,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-14 03:43:32,200 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-14 03:43:32,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 36 states and 46 transitions. Complement of second has 9 states. [2019-01-14 03:43:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 03:43:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:43:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-14 03:43:32,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:32,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:32,263 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:43:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:43:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:32,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:43:32,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:43:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:43:32,346 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-14 03:43:32,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-14 03:43:32,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 37 states and 48 transitions. Complement of second has 8 states. [2019-01-14 03:43:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 03:43:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:43:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 03:43:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 03:43:32,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 18 letters. Loop has 2 letters. [2019-01-14 03:43:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:32,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-14 03:43:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:43:32,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-01-14 03:43:32,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:43:32,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-14 03:43:32,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:43:32,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:43:32,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:43:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:43:32,416 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:43:32,416 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:43:32,416 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:43:32,416 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 03:43:32,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:43:32,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:43:32,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:43:32,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:43:32 BoogieIcfgContainer [2019-01-14 03:43:32,423 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:43:32,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:43:32,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:43:32,424 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:43:32,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:41:08" (3/4) ... [2019-01-14 03:43:32,428 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:43:32,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:43:32,429 INFO L168 Benchmark]: Toolchain (without parser) took 144962.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 950.0 MB in the beginning and 929.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 264.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:43:32,430 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:43:32,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:43:32,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:43:32,431 INFO L168 Benchmark]: Boogie Preprocessor took 45.53 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:43:32,432 INFO L168 Benchmark]: RCFGBuilder took 567.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:43:32,432 INFO L168 Benchmark]: BuchiAutomizer took 143988.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 163.2 MB). Peak memory consumption was 283.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:43:32,433 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.3 GB. Free memory is still 929.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:43:32,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.53 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 567.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 143988.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 163.2 MB). Peak memory consumption was 283.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.3 GB. Free memory is still 929.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (0 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * z + k and consists of 5 locations. One deterministic module has affine ranking function k + -1 * z and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 143.9s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 140.2s. Construction of modules took 0.3s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 58 states and ocurred in iteration 8. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 310 SDtfs, 494 SDslu, 110 SDs, 0 SdLazy, 187 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf97 lsp44 ukn100 mio100 lsp100 div296 bol100 ite100 ukn100 eq146 hnf47 smp90 dnf100 smp100 tf101 neg98 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 38 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 10 LassoNonterminationAnalysisTime: 126.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...