./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 2e94e6aa 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-2e94e6a [2019-01-01 22:59:26,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:59:26,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:59:26,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:59:26,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:59:26,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:59:26,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:59:26,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:59:26,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:59:26,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:59:26,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:59:26,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:59:26,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:59:26,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:59:26,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:59:26,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:59:26,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:59:26,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:59:26,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:59:26,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:59:26,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:59:26,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:59:26,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:59:26,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:59:26,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:59:26,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:59:26,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:59:26,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:59:26,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:59:26,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:59:26,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:59:26,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:59:26,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:59:26,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:59:26,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:59:26,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:59:26,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:59:26,783 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:59:26,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:59:26,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:59:26,785 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:59:26,785 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:59:26,785 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:59:26,785 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:59:26,786 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:59:26,787 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:59:26,787 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:59:26,787 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:59:26,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:59:26,787 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:59:26,787 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:59:26,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:59:26,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:59:26,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:59:26,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:59:26,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:59:26,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:59:26,790 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:59:26,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:59:26,790 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:59:26,791 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:59:26,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:59:26,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:59:26,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:59:26,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:59:26,793 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:59:26,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:59:26,793 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:59:26,794 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:59:26,795 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-01 22:59:26,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:59:26,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:59:26,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:59:26,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:59:26,882 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:59:26,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i [2019-01-01 22:59:26,949 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb75b20f8/12943b0e89514aaca09a6aba616ba4cf/FLAG83dc991d7 [2019-01-01 22:59:27,396 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:59:27,397 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i [2019-01-01 22:59:27,402 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb75b20f8/12943b0e89514aaca09a6aba616ba4cf/FLAG83dc991d7 [2019-01-01 22:59:27,763 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb75b20f8/12943b0e89514aaca09a6aba616ba4cf [2019-01-01 22:59:27,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:59:27,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:59:27,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:59:27,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:59:27,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:59:27,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:59:27" (1/1) ... [2019-01-01 22:59:27,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0562b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:27, skipping insertion in model container [2019-01-01 22:59:27,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:59:27" (1/1) ... [2019-01-01 22:59:27,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:59:27,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:59:28,054 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:59:28,062 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:59:28,093 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:59:28,114 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:59:28,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28 WrapperNode [2019-01-01 22:59:28,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:59:28,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:59:28,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:59:28,116 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:59:28,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:59:28,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:59:28,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:59:28,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:59:28,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (1/1) ... [2019-01-01 22:59:28,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:59:28,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:59:28,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:59:28,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:59:28,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (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-01 22:59:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:59:28,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:59:28,986 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:59:28,986 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-01 22:59:28,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:28 BoogieIcfgContainer [2019-01-01 22:59:28,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:59:28,988 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:59:28,988 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:59:28,992 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:59:28,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:28,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:59:27" (1/3) ... [2019-01-01 22:59:28,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2522fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:59:28, skipping insertion in model container [2019-01-01 22:59:28,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:28,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:28" (2/3) ... [2019-01-01 22:59:28,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2522fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:59:28, skipping insertion in model container [2019-01-01 22:59:28,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:28,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:28" (3/3) ... [2019-01-01 22:59:28,998 INFO L375 chiAutomizerObserver]: Analyzing ICFG trex01_true-unreach-call_true-termination.i [2019-01-01 22:59:29,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:59:29,060 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:59:29,061 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:59:29,061 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:59:29,061 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:59:29,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:59:29,061 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:59:29,062 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:59:29,062 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:59:29,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-01 22:59:29,107 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:59:29,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:29,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:29,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:29,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:29,117 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:59:29,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-01 22:59:29,120 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:59:29,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:29,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:29,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:29,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:29,131 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-01 22:59:29,132 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-01 22:59:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 30886, now seen corresponding path program 1 times [2019-01-01 22:59:29,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 22:59:29,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:29,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 957485, now seen corresponding path program 1 times [2019-01-01 22:59:29,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:29,425 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:29,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:29,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:29,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:29,427 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:29,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:29,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:29,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:29,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:59:29,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:29,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:29,453 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-01 22:59:29,484 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-01 22:59:29,499 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-01 22:59:29,511 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-01 22:59:29,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-01 22:59:29,523 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-01 22:59:29,526 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-01 22:59:29,532 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-01 22:59:29,536 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-01 22:59:29,538 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-01 22:59:29,685 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-01 22:59:29,715 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-01 22:59:29,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-01 22:59:29,994 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 22:59:30,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:30,247 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-01 22:59:30,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,276 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-01 22:59:30,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,312 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-01 22:59:30,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,337 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,337 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-01 22:59:30,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,376 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-01 22:59:30,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,407 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,412 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-01 22:59:30,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,437 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-01 22:59:30,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,470 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,470 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-01 22:59:30,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,495 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,495 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-01 22:59:30,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:30,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:30,520 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-01 22:59:30,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:30,542 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-01 22:59:30,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:30,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:42,639 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:59:42,646 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:42,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:42,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:42,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:42,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:42,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:42,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:42,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:42,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:59:42,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:42,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:42,652 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-01 22:59:42,665 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-01 22:59:42,670 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-01 22:59:42,678 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-01 22:59:42,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-01 22:59:42,688 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-01 22:59:42,693 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-01 22:59:42,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-01 22:59:42,765 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-01 22:59:42,767 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-01 22:59:42,770 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-01 22:59:42,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-01 22:59:42,779 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-01 22:59:43,310 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 22:59:43,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:43,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:43,688 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-01 22:59:43,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:43,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:43,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:43,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,697 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-01 22:59:43,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:43,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:43,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:43,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,701 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-01 22:59:43,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:43,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:43,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:43,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,704 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-01 22:59:43,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:43,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:43,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:43,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,708 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-01 22:59:43,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:43,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:43,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:43,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,712 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-01 22:59:43,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:43,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:43,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:43,729 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-01 22:59:43,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:43,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:43,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:43,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:43,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:43,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:43,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:43,836 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:59:43,840 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:43,844 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:43,849 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:43,850 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:43,852 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-01 22:59:43,880 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:59:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:43,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:44,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:44,002 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-01 22:59:44,017 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-01 22:59:44,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-01-01 22:59:44,188 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-01 22:59:44,190 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-01 22:59:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2019-01-01 22:59:44,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 22:59:44,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:44,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 22:59:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:44,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 22:59:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:44,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 128 transitions. [2019-01-01 22:59:44,206 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-01-01 22:59:44,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 29 states and 37 transitions. [2019-01-01 22:59:44,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 22:59:44,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:59:44,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-01 22:59:44,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:59:44,215 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-01 22:59:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-01 22:59:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-01 22:59:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 22:59:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-01 22:59:44,242 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 22:59:44,242 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-01 22:59:44,243 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:59:44,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-01 22:59:44,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:59:44,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:44,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:44,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:44,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:44,246 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-01 22:59:44,246 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-01 22:59:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 32998, now seen corresponding path program 1 times [2019-01-01 22:59:44,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:44,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2019-01-01 22:59:44,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1023023, now seen corresponding path program 1 times [2019-01-01 22:59:44,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:44,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:44,375 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:44,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:44,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:44,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:44,376 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:44,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:44,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:44,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:44,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:59:44,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:44,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:44,380 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-01 22:59:44,390 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-01 22:59:44,395 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-01 22:59:44,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-01 22:59:44,418 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-01 22:59:44,420 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-01 22:59:44,426 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-01 22:59:44,436 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-01 22:59:44,451 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-01 22:59:44,454 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-01 22:59:44,458 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-01 22:59:44,463 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-01 22:59:44,469 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-01 22:59:44,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:44,681 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-01 22:59:44,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,692 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-01 22:59:44,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,732 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-01 22:59:44,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,757 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,760 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-01 22:59:44,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,789 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,790 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-01 22:59:44,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,824 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-01 22:59:44,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,851 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-01 22:59:44,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:44,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:44,891 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-01 22:59:44,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:44,913 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-01 22:59:44,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:44,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:59,573 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:59:59,580 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:59,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:59,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:59,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:59,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:59,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:59,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:59,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:59:59,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:59,582 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:59,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-01 22:59:59,590 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-01 22:59:59,591 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-01 22:59:59,596 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-01 22:59:59,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-01 22:59:59,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-01 22:59:59,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-01 22:59:59,622 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-01 22:59:59,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-01 22:59:59,634 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-01 22:59:59,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-01 22:59:59,640 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-01 22:59:59,642 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-01 22:59:59,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:59,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:59,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-01 22:59:59,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:59,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:59,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:59,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:59,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:59,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:59,758 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-01 22:59:59,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:59,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:59,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:59,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:59,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:59,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:59,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:59,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:59,761 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-01 22:59:59,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:59,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:59,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:59,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:59,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:59,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:59,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:59,769 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-01 22:59:59,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:59,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:59,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:59,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:59,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:59,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:59,842 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:59,867 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 22:59:59,868 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:59:59,868 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:59,870 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:59,870 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:59,870 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-01 22:59:59,892 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:00,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:00,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:00,141 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-01 23:00:00,141 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-01 23:00:00,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 23:00:00,199 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-01 23:00:00,200 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-01 23:00:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-01 23:00:00,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 23:00:00,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:00,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 23:00:00,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:00,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 23:00:00,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:00,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-01-01 23:00:00,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-01 23:00:00,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 39 transitions. [2019-01-01 23:00:00,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 23:00:00,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:00:00,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-01 23:00:00,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:00,207 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-01 23:00:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-01 23:00:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 23:00:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 23:00:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-01-01 23:00:00,210 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-01 23:00:00,211 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-01 23:00:00,211 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:00:00,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-01-01 23:00:00,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:00:00,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:00,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:00,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:00,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:00,213 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-01 23:00:00,213 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-01 23:00:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:00,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1466276473, now seen corresponding path program 1 times [2019-01-01 23:00:00,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:00,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 1 times [2019-01-01 23:00:00,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash 342419296, now seen corresponding path program 1 times [2019-01-01 23:00:00,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:00,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:00,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:00,570 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-01 23:00:00,571 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:00,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:00,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:00,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:00,572 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:00,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:00,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:00,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-01 23:00:00,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:00,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:00,575 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-01 23:00:00,601 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-01 23:00:00,609 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-01 23:00:00,611 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-01 23:00:00,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-01 23:00:00,616 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-01 23:00:00,626 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-01 23:00:00,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-01 23:00:00,647 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-01 23:00:00,652 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-01 23:00:00,657 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-01 23:00:00,659 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-01 23:00:00,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:00,894 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-01 23:00:00,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,901 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-01 23:00:00,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:00,927 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,979 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:00:12,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:12,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:12,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:12,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:12,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:12,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:12,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:12,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-01 23:00:12,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:12,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:12,989 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-01 23:00:13,001 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-01 23:00:13,006 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-01 23:00:13,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-01 23:00:13,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-01 23:00:13,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-01 23:00:13,031 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-01 23:00:13,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-01 23:00:13,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-01 23:00:13,039 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-01 23:00:13,040 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-01 23:00:13,047 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-01 23:00:13,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:13,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:13,243 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-01 23:00:13,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:13,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:13,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:13,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:13,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:13,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:13,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:13,307 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:00:13,308 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:13,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:13,312 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:13,312 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:13,312 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-01 23:00:13,343 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:13,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:13,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:13,519 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-01 23:00:13,519 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-01 23:00:13,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 23:00:13,562 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-01 23:00:13,562 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-01 23:00:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-01 23:00:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 23:00:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 23:00:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 23:00:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:13,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-01 23:00:13,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:00:13,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2019-01-01 23:00:13,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 23:00:13,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 23:00:13,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-01 23:00:13,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:13,568 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 23:00:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-01 23:00:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-01 23:00:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 23:00:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-01 23:00:13,572 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-01 23:00:13,572 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-01 23:00:13,572 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:00:13,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-01 23:00:13,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:00:13,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:13,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:13,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:13,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:13,577 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-01 23:00:13,577 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-01 23:00:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 925850489, now seen corresponding path program 1 times [2019-01-01 23:00:13,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 1 times [2019-01-01 23:00:13,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:13,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash 684093600, now seen corresponding path program 1 times [2019-01-01 23:00:13,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:13,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:13,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:13,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:13,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:13,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:13,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:13,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:13,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:13,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:13,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:13,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:13,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-01 23:00:13,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:13,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:13,869 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-01 23:00:13,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-01 23:00:13,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-01 23:00:13,892 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-01 23:00:13,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-01 23:00:13,920 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-01 23:00:13,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-01 23:00:13,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-01 23:00:13,935 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-01 23:00:13,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-01 23:00:13,946 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-01 23:00:13,953 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-01 23:00:14,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:14,234 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-01 23:00:14,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:14,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:14,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:14,245 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) [2019-01-01 23:00:14,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:14,285 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:14,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:14,298 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-01 23:00:14,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:14,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:14,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:14,333 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-01 23:00:14,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:14,353 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-01 23:00:14,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:14,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:26,432 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:00:26,436 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:26,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:26,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:26,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:26,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:26,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:26,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:26,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:26,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-01 23:00:26,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:26,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:26,439 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-01 23:00:26,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-01 23:00:26,456 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-01 23:00:26,460 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-01 23:00:26,467 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-01 23:00:26,512 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-01 23:00:26,593 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-01 23:00:26,609 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-01 23:00:26,612 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-01 23:00:26,613 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-01 23:00:26,621 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-01 23:00:26,623 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-01 23:00:26,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:26,810 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:26,811 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-01 23:00:26,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,813 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-01 23:00:26,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,819 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-01 23:00:26,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,824 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-01 23:00:26,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,831 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-01 23:00:26,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:26,849 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:00:26,849 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:00:26,849 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:26,851 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:26,851 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:26,851 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-01 23:00:26,871 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:26,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:26,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:27,037 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-01 23:00:27,037 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-01 23:00:27,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 23:00:27,093 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-01 23:00:27,098 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-01 23:00:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-01 23:00:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 23:00:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 23:00:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 23:00:27,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2019-01-01 23:00:27,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:00:27,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 44 transitions. [2019-01-01 23:00:27,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:00:27,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 23:00:27,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-01-01 23:00:27,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:27,107 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-01 23:00:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-01-01 23:00:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-01 23:00:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 23:00:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-01-01 23:00:27,113 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:27,113 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:27,113 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:00:27,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-01-01 23:00:27,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 23:00:27,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:27,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:27,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:27,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:27,115 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-01 23:00:27,116 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-01 23:00:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash 342419292, now seen corresponding path program 1 times [2019-01-01 23:00:27,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash 91200, now seen corresponding path program 1 times [2019-01-01 23:00:27,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:27,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:27,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:27,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash 465861381, now seen corresponding path program 1 times [2019-01-01 23:00:27,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:27,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:27,288 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 23:00:27,304 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:27,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:27,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:27,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:27,305 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:27,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:27,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:27,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:27,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-01 23:00:27,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:27,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:27,308 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-01 23:00:27,314 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-01 23:00:27,321 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-01 23:00:27,325 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-01 23:00:27,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:27,454 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-01 23:00:27,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:27,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:27,480 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:27,480 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-01 23:00:27,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:27,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:27,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:27,505 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-01 23:00:27,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:27,531 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-01 23:00:27,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:27,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:27,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:27,568 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-01 23:00:27,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:27,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:27,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:27,601 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-01 23:00:27,806 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:27,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:27,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:27,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:27,807 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:27,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:27,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:27,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:27,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-01 23:00:27,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:27,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:27,810 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-01 23:00:27,852 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-01 23:00:27,876 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-01 23:00:28,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-01 23:00:28,140 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:00:28,214 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-01 23:00:28,301 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-01 23:00:28,324 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-01 23:00:28,350 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-01 23:00:28,440 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-01 23:00:28,466 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-01 23:00:28,492 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-01 23:00:28,771 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 23:00:28,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:29,000 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-01 23:00:29,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:29,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:29,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:29,031 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-01 23:00:29,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:29,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:29,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:29,057 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-01 23:00:29,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:29,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:29,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:29,095 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-01 23:00:29,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:29,117 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-01 23:00:29,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:29,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:42,718 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:00:42,723 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:42,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:42,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:42,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:42,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:42,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:42,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:42,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:42,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-01 23:00:42,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:42,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:42,726 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-01 23:00:42,738 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-01 23:00:42,740 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-01 23:00:42,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-01 23:00:42,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-01 23:00:42,779 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-01 23:00:42,784 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-01 23:00:42,786 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-01 23:00:42,790 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-01 23:00:42,792 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-01 23:00:42,793 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-01 23:00:43,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:43,009 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:43,010 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-01 23:00:43,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:43,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:43,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:43,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:43,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:43,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:43,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:43,021 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-01 23:00:43,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:43,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:43,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:43,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:43,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:43,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:43,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:43,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:43,024 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-01 23:00:43,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:43,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:43,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:43,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:43,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:43,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:43,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:43,046 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 23:00:43,046 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:43,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:43,047 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:43,048 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:43,048 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-01 23:00:43,078 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:43,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:43,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:43,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-01 23:00:43,237 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-01 23:00:43,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-01 23:00:43,353 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-01 23:00:43,354 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-01 23:00:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:00:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-01 23:00:43,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 23:00:43,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:43,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:00:43,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:43,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-01 23:00:43,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:43,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-01-01 23:00:43,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 23:00:43,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 51 transitions. [2019-01-01 23:00:43,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:00:43,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 23:00:43,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-01-01 23:00:43,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:43,360 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-01-01 23:00:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-01-01 23:00:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-01 23:00:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 23:00:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2019-01-01 23:00:43,363 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-01 23:00:43,363 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-01 23:00:43,363 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:00:43,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2019-01-01 23:00:43,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 23:00:43,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:43,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:43,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:43,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:43,365 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-01 23:00:43,365 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-01 23:00:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash 684093596, now seen corresponding path program 1 times [2019-01-01 23:00:43,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:43,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:43,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash 156738, now seen corresponding path program 1 times [2019-01-01 23:00:43,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash 212625863, now seen corresponding path program 1 times [2019-01-01 23:00:43,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,461 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:43,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:43,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:43,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:43,461 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:43,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:43,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:43,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:43,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 23:00:43,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:43,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:43,463 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-01 23:00:43,470 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-01 23:00:43,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-01 23:00:43,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-01 23:00:43,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:43,636 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-01 23:00:43,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:43,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:43,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:43,651 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-01 23:00:43,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:43,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:43,693 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:43,694 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-01 23:00:43,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:43,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:43,709 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:43,709 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-01 23:00:43,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:43,730 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-01 23:00:43,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:43,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:43,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:43,767 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-01 23:00:43,938 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:43,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:43,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:43,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:43,939 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:43,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:43,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:43,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:43,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-01 23:00:43,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:43,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:43,942 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-01 23:00:43,954 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-01 23:00:43,962 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-01 23:00:43,968 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-01 23:00:43,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-01 23:00:43,974 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-01 23:00:43,977 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-01 23:00:43,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-01 23:00:43,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-01 23:00:43,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-01 23:00:44,002 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-01 23:00:44,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:44,229 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-01 23:00:44,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:44,234 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-01 23:00:44,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:44,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:57,584 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:00:57,589 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:57,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:57,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:57,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:57,589 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:57,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:57,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:57,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:57,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-01 23:00:57,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:57,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:57,591 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-01 23:00:57,611 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-01 23:00:57,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-01 23:00:57,618 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-01 23:00:57,623 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-01 23:00:57,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-01 23:00:57,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-01 23:00:57,630 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-01 23:00:57,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-01 23:00:57,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-01 23:00:57,659 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-01 23:00:57,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:57,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:57,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-01 23:00:57,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:57,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:57,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:57,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:57,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:57,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:57,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:57,895 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:00:57,895 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 23:00:57,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:57,897 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:57,898 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:57,898 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-01 23:00:57,932 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:58,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:58,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:58,088 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-01 23:00:58,089 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-01 23:00:58,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-01-01 23:00:58,165 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-01 23:00:58,166 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-01 23:00:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:00:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-01 23:00:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 23:00:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:00:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-01 23:00:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:58,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-01-01 23:00:58,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:58,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 43 states and 58 transitions. [2019-01-01 23:00:58,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:00:58,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 23:00:58,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2019-01-01 23:00:58,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:58,172 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-01-01 23:00:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2019-01-01 23:00:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-01 23:00:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 23:00:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2019-01-01 23:00:58,177 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-01-01 23:00:58,177 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-01-01 23:00:58,177 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:00:58,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2019-01-01 23:00:58,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:58,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:58,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:58,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:58,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:58,180 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-01 23:00:58,180 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-01 23:00:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 465861385, now seen corresponding path program 1 times [2019-01-01 23:00:58,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:58,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:58,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 2 times [2019-01-01 23:00:58,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:58,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:58,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1016194032, now seen corresponding path program 2 times [2019-01-01 23:00:58,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:58,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:58,397 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:00:58,535 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:00:58,922 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-01 23:00:58,982 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:58,982 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:58,982 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:58,982 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:58,982 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:58,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:58,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:58,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:58,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 23:00:58,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:58,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:58,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-01 23:00:58,991 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-01 23:00:58,999 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-01 23:00:59,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-01 23:00:59,020 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-01 23:00:59,024 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-01 23:00:59,029 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-01 23:00:59,032 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-01 23:00:59,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-01 23:00:59,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-01 23:00:59,040 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-01 23:00:59,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-01 23:00:59,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:59,310 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-01 23:00:59,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:59,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:59,318 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:59,319 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) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:59,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:59,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:59,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:59,352 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-01 23:00:59,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:59,373 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-01 23:00:59,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:59,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:11,450 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:01:11,454 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:11,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:11,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:11,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:11,455 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:01:11,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:11,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:11,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:11,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 23:01:11,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:11,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:11,457 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-01 23:01:11,470 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-01 23:01:11,479 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-01 23:01:11,483 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-01 23:01:11,486 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-01 23:01:11,493 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-01 23:01:11,496 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-01 23:01:11,502 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-01 23:01:11,506 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-01 23:01:11,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-01 23:01:11,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-01 23:01:11,534 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-01 23:01:11,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:11,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:01:11,863 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-01 23:01:11,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:11,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:11,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,874 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-01 23:01:11,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:11,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:11,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,887 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-01 23:01:11,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:11,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:11,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:11,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,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-01 23:01:11,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:11,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:11,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,903 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-01 23:01:11,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:11,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:11,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,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-01 23:01:11,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:11,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:11,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:11,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,914 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-01 23:01:11,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:11,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:11,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:11,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,920 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-01 23:01:11,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:11,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:11,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:11,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:11,922 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-01 23:01:11,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:11,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:11,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:11,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:11,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:11,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:11,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:01:11,967 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:01:11,967 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:01:11,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:01:11,971 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:01:11,972 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:01:11,972 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-01 23:01:12,000 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:01:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:12,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:12,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:12,126 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-01 23:01:12,126 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-01 23:01:12,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 57 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-01-01 23:01:12,172 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-01 23:01:12,181 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-01 23:01:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:01:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-01 23:01:12,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:01:12,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:12,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:12,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:12,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 23:01:12,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:12,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-01 23:01:12,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:01:12,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 52 states and 69 transitions. [2019-01-01 23:01:12,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:01:12,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:01:12,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2019-01-01 23:01:12,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:01:12,190 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-01-01 23:01:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2019-01-01 23:01:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-01-01 23:01:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 23:01:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2019-01-01 23:01:12,196 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-01-01 23:01:12,196 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-01-01 23:01:12,196 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:01:12,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2019-01-01 23:01:12,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:01:12,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:01:12,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:01:12,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:01:12,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:01:12,198 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-01 23:01:12,198 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-01 23:01:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash 212625867, now seen corresponding path program 1 times [2019-01-01 23:01:12,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:12,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 2 times [2019-01-01 23:01:12,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:01:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1824968078, now seen corresponding path program 2 times [2019-01-01 23:01:12,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:12,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:12,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:12,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:12,451 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-01 23:01:12,482 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:12,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:12,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:12,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:12,483 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:01:12,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:12,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:12,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:12,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 23:01:12,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:12,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:12,486 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-01 23:01:12,496 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-01 23:01:12,498 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-01 23:01:12,506 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-01 23:01:12,559 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-01 23:01:12,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-01 23:01:12,564 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-01 23:01:12,567 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-01 23:01:12,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-01 23:01:12,589 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-01 23:01:12,591 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-01 23:01:12,594 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-01 23:01:12,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:12,861 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-01 23:01:12,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:12,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:12,869 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-01 23:01:12,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:12,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:12,896 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-01 23:01:12,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,917 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:12,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:12,929 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-01 23:01:12,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:12,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:12,953 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-01 23:01:12,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:12,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:12,977 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-01 23:01:12,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:12,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:13,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:13,001 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-01 23:01:13,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:13,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:13,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:13,024 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-01 23:01:13,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:13,045 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-01 23:01:13,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:01:13,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:25,436 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:01:25,440 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:25,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:25,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:25,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:25,441 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:01:25,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:25,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:25,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:25,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 23:01:25,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:25,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:25,443 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-01 23:01:25,472 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-01 23:01:25,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-01 23:01:25,489 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-01 23:01:25,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-01 23:01:25,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-01 23:01:25,522 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-01 23:01:25,541 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-01 23:01:25,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-01 23:01:25,545 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-01 23:01:25,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-01 23:01:25,548 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-01 23:01:25,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:25,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:01:25,857 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-01 23:01:25,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,863 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-01 23:01:25,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,867 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-01 23:01:25,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:25,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:25,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:25,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,869 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-01 23:01:25,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,872 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-01 23:01:25,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,875 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-01 23:01:25,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:25,879 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-01 23:01:25,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:25,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:25,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:25,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:25,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:25,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:25,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:01:25,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:01:25,894 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:01:25,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:01:25,896 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:01:25,896 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:01:25,896 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-01 23:01:25,927 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:01:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:25,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:25,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:26,005 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-01 23:01:26,006 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-01 23:01:26,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 67 transitions. cyclomatic complexity: 27 Second operand 4 states. [2019-01-01 23:01:26,062 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-01 23:01:26,067 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-01 23:01:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:01:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-01 23:01:26,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:01:26,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:26,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:26,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:26,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 23:01:26,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:26,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2019-01-01 23:01:26,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:01:26,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 79 transitions. [2019-01-01 23:01:26,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:01:26,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:01:26,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-01-01 23:01:26,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:01:26,071 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-01 23:01:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-01-01 23:01:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-01-01 23:01:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 23:01:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-01-01 23:01:26,079 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-01-01 23:01:26,082 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-01-01 23:01:26,082 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:01:26,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2019-01-01 23:01:26,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:01:26,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:01:26,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:01:26,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:01:26,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:01:26,083 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-01 23:01:26,084 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-01 23:01:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1126180482, now seen corresponding path program 3 times [2019-01-01 23:01:26,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:26,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:26,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:26,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 3 times [2019-01-01 23:01:26,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:26,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:26,109 INFO L82 PathProgramCache]: Analyzing trace with hash -72313559, now seen corresponding path program 4 times [2019-01-01 23:01:26,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:26,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:26,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:26,354 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-01 23:01:26,437 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:26,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:26,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:26,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:26,438 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:01:26,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:26,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:26,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:26,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 23:01:26,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:26,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:26,440 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-01 23:01:26,447 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-01 23:01:26,465 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-01 23:01:26,467 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-01 23:01:26,469 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-01 23:01:26,470 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-01 23:01:26,474 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-01 23:01:26,475 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-01 23:01:26,476 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-01 23:01:26,478 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-01 23:01:26,480 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-01 23:01:26,484 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-01 23:01:26,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:26,696 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-01 23:01:26,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:26,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:26,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:01:26,708 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-01 23:01:26,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:26,730 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-01 23:01:26,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:01:26,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:01:38,815 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:01:38,820 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:38,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:38,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:38,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:38,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:01:38,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:38,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:38,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:38,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 23:01:38,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:38,821 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:38,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-01 23:01:38,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-01 23:01:38,856 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-01 23:01:38,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-01 23:01:38,864 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-01 23:01:38,869 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-01 23:01:38,872 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-01 23:01:38,886 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-01 23:01:38,907 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-01 23:01:38,910 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-01 23:01:38,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-01 23:01:38,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-01 23:01:39,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:39,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:01:39,244 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-01 23:01:39,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:39,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:39,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,253 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-01 23:01:39,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:39,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:39,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:39,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,262 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-01 23:01:39,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:39,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:39,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:39,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,267 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-01 23:01:39,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:39,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:39,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:39,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,269 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-01 23:01:39,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:39,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:39,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,277 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-01 23:01:39,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:39,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:39,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:39,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,281 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-01 23:01:39,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:39,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:39,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:39,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:39,283 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-01 23:01:39,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:39,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:39,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:39,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:39,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:39,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:39,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:01:39,331 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:01:39,334 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:01:39,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:01:39,335 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:01:39,335 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:01:39,335 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-01 23:01:39,379 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:01:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:39,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:39,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:39,956 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-01 23:01:39,956 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-01 23:01:39,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 23:01:39,995 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-01 23:01:39,996 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-01 23:01:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:01:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-01 23:01:39,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:39,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:39,998 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:01:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:40,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:40,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:40,062 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-01 23:01:40,062 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-01 23:01:40,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 23:01:40,099 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-01 23:01:40,100 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-01 23:01:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:01:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-01-01 23:01:40,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:40,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:40,102 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:01:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:40,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:40,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:40,174 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-01 23:01:40,174 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-01 23:01:40,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-01 23:01:40,215 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-01 23:01:40,216 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-01 23:01:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:01:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2019-01-01 23:01:40,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:40,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:40,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 18 letters. Loop has 2 letters. [2019-01-01 23:01:40,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:40,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-01 23:01:40,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:40,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2019-01-01 23:01:40,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:01:40,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 30 states and 39 transitions. [2019-01-01 23:01:40,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 23:01:40,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 23:01:40,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-01 23:01:40,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:01:40,220 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-01 23:01:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-01 23:01:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 23:01:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 23:01:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-01 23:01:40,228 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-01 23:01:40,228 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-01 23:01:40,228 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:01:40,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-01 23:01:40,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:01:40,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:01:40,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:01:40,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:01:40,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:01:40,230 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-01 23:01:40,230 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-01 23:01:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1714981628, now seen corresponding path program 3 times [2019-01-01 23:01:40,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 3 times [2019-01-01 23:01:40,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:40,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1170101099, now seen corresponding path program 4 times [2019-01-01 23:01:40,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:01:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:01:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:01:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:01:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:01:40,568 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-01 23:01:40,765 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-01 23:01:40,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:40,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:40,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:40,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:40,768 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:01:40,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:40,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:40,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:40,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-01 23:01:40,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:40,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:40,770 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-01 23:01:40,789 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-01 23:01:40,792 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-01 23:01:40,795 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-01 23:01:40,797 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-01 23:01:40,798 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-01 23:01:40,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-01 23:01:40,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-01 23:01:40,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-01 23:01:40,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-01 23:01:40,807 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-01 23:01:40,814 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-01 23:01:41,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:41,056 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-01 23:01:41,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:01:41,062 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) [2019-01-01 23:01:41,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:01:41,117 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:53,177 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:01:53,182 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:01:53,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:01:53,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:01:53,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:01:53,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:01:53,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:01:53,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:01:53,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:01:53,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_true-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-01 23:01:53,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:01:53,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:01:53,184 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-01 23:01:53,190 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-01 23:01:53,198 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-01 23:01:53,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-01 23:01:53,205 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-01 23:01:53,216 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-01 23:01:53,218 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-01 23:01:53,220 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-01 23:01:53,230 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-01 23:01:53,232 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-01 23:01:53,236 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-01 23:01:53,263 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-01 23:01:53,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:01:53,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:01:53,537 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-01 23:01:53,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:53,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:53,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:53,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,540 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-01 23:01:53,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,545 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-01 23:01:53,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,548 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-01 23:01:53,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:53,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:53,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:53,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,549 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-01 23:01:53,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,552 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-01 23:01:53,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:53,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:53,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:53,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,554 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-01 23:01:53,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:53,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:53,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:53,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,556 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-01 23:01:53,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,559 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-01 23:01:53,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:01:53,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:01:53,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:01:53,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,561 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-01 23:01:53,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:01:53,564 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-01 23:01:53,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:01:53,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:01:53,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:01:53,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:01:53,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:01:53,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:01:53,575 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:01:53,582 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:01:53,582 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:01:53,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:01:53,584 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:01:53,584 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:01:53,584 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-01 23:01:53,612 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:01:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:53,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:53,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:53,816 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-01 23:01:53,817 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-01 23:01:53,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-01 23:01:53,892 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-01 23:01:53,894 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-01 23:01:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:01:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-01 23:01:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:53,895 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:01:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:53,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:53,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:54,029 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-01 23:01:54,030 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-01 23:01:54,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-01 23:01:54,092 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-01 23:01:54,093 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-01 23:01:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:01:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-01 23:01:54,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:54,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:54,094 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:01:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:01:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:54,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:01:54,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:01:54,197 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-01 23:01:54,197 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-01 23:01:54,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 6 states. [2019-01-01 23:01:54,277 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-01 23:01:54,278 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-01 23:01:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:01:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-01 23:01:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:01:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 18 letters. Loop has 2 letters. [2019-01-01 23:01:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-01 23:01:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:01:54,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-01-01 23:01:54,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:01:54,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-01 23:01:54,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:01:54,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:01:54,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:01:54,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:01:54,283 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:01:54,284 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:01:54,284 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:01:54,284 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:01:54,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:01:54,285 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:01:54,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:01:54,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:01:54 BoogieIcfgContainer [2019-01-01 23:01:54,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:01:54,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:01:54,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:01:54,294 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:01:54,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:28" (3/4) ... [2019-01-01 23:01:54,306 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:01:54,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:01:54,308 INFO L168 Benchmark]: Toolchain (without parser) took 146538.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.4 MB). Free memory was 947.3 MB in the beginning and 951.1 MB in the end (delta: -3.7 MB). Peak memory consumption was 242.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:01:54,309 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:01:54,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:01:54,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:01:54,311 INFO L168 Benchmark]: Boogie Preprocessor took 27.21 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:01:54,311 INFO L168 Benchmark]: RCFGBuilder took 794.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:01:54,316 INFO L168 Benchmark]: BuchiAutomizer took 145305.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 163.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:01:54,317 INFO L168 Benchmark]: Witness Printer took 11.66 ms. Allocated memory is still 1.3 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:01:54,322 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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 48.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.21 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 145305.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 163.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 11.66 ms. Allocated memory is still 1.3 GB. Free memory is still 951.1 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 145.2s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 141.7s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. 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: 16ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 38 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 10 LassoNonterminationAnalysisTime: 127.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...