./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/trex01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/trex01-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer --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-cad4683 [2019-10-22 08:55:41,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:41,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:41,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:41,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:41,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:41,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:41,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:41,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:41,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:41,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:41,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:41,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:41,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:41,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:41,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:41,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:41,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:41,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:41,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:41,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:41,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:41,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:41,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:41,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:41,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:41,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:41,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:41,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:41,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:41,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:41,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:41,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:41,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:41,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:41,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:41,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:41,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:41,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:41,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:41,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:41,891 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:41,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:41,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:41,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:41,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:41,905 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:41,905 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:41,906 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:41,906 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:41,906 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:41,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:41,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:41,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:41,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:41,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:41,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:41,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:41,909 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:41,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:41,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:41,909 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:41,910 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:41,911 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer 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-10-22 08:55:41,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:41,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:41,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:41,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:41,955 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:41,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/../../sv-benchmarks/c/loops/trex01-2.i [2019-10-22 08:55:42,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/data/97a018b82/3b76b318d1594771b19c6cf109c7346a/FLAG1b95cef89 [2019-10-22 08:55:42,391 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:42,391 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/sv-benchmarks/c/loops/trex01-2.i [2019-10-22 08:55:42,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/data/97a018b82/3b76b318d1594771b19c6cf109c7346a/FLAG1b95cef89 [2019-10-22 08:55:42,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/data/97a018b82/3b76b318d1594771b19c6cf109c7346a [2019-10-22 08:55:42,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:42,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:42,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:42,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:42,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:42,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:42" (1/1) ... [2019-10-22 08:55:42,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ced30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:42, skipping insertion in model container [2019-10-22 08:55:42,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:42" (1/1) ... [2019-10-22 08:55:42,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:42,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:42,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:42,958 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:43,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:43,049 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:43,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43 WrapperNode [2019-10-22 08:55:43,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:43,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:43,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:43,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:43,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:43,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:43,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:43,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:43,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... [2019-10-22 08:55:43,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:43,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:43,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:43,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:43,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:43,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:43,340 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 08:55:43,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:43 BoogieIcfgContainer [2019-10-22 08:55:43,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:43,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:43,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:43,345 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:43,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:43,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:42" (1/3) ... [2019-10-22 08:55:43,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd2b573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:43, skipping insertion in model container [2019-10-22 08:55:43,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:43,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:43" (2/3) ... [2019-10-22 08:55:43,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd2b573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:43, skipping insertion in model container [2019-10-22 08:55:43,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:43,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:43" (3/3) ... [2019-10-22 08:55:43,350 INFO L371 chiAutomizerObserver]: Analyzing ICFG trex01-2.i [2019-10-22 08:55:43,390 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:43,390 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:43,390 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:43,390 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:43,390 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:43,391 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:43,391 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:43,391 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:43,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-10-22 08:55:43,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:55:43,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:43,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:43,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:43,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:43,430 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:43,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-10-22 08:55:43,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:55:43,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:43,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:43,433 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:43,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:43,440 INFO L791 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-10-22 08:55:43,440 INFO L793 eck$LassoCheckResult]: Loop: 13#L16-2true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 13#L16-2true [2019-10-22 08:55:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 30886, now seen corresponding path program 1 times [2019-10-22 08:55:43,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:43,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279778057] [2019-10-22 08:55:43,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-10-22 08:55:43,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:43,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445097662] [2019-10-22 08:55:43,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 957485, now seen corresponding path program 1 times [2019-10-22 08:55:43,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:43,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876565386] [2019-10-22 08:55:43,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:43,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:43,680 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:43,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:43,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:43,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:43,681 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:43,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:43,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:43,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration1_Lasso [2019-10-22 08:55:43,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:43,682 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:43,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,892 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:43,893 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,902 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,910 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,911 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:43,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,919 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:43,927 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,927 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,942 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,955 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,967 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,974 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:43,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:43,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:43,988 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:43,988 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-152} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:44,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,003 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:44,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,007 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:44,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:44,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:44,020 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:44,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:44,029 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:44,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:44,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:56,155 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 08:55:56,161 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:56,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:56,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:56,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:56,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:56,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:56,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:56,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:56,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration1_Lasso [2019-10-22 08:55:56,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:56,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:56,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,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-10-22 08:55:56,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,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-10-22 08:55:56,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,351 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:56,356 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:56,357 INFO L120 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-10-22 08:55:56,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:56,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:56,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:56,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,366 INFO L120 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-10-22 08:55:56,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:56,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:56,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:56,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,369 INFO L120 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-10-22 08:55:56,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:56,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:56,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:56,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,372 INFO L120 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-10-22 08:55:56,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:56,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:56,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:56,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,376 INFO L120 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-10-22 08:55:56,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:56,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,378 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:56,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:56,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,380 INFO L120 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-10-22 08:55:56,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:56,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:56,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:56,396 INFO L120 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-10-22 08:55:56,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:56,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:56,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:56,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:56,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:56,405 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:56,487 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:56,528 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:56,529 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:56,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:56,539 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:55:56,539 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:56,540 INFO L512 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-10-22 08:55:56,555 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:55:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:56,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:55:56,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:56,639 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-10-22 08:55:56,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-10-22 08:55:56,727 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-10-22 08:55:56,727 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-10-22 08:55:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2019-10-22 08:55:56,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 1 letters. [2019-10-22 08:55:56,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:56,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 1 letters. [2019-10-22 08:55:56,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:56,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:55:56,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:56,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 128 transitions. [2019-10-22 08:55:56,741 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-10-22 08:55:56,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 29 states and 37 transitions. [2019-10-22 08:55:56,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:55:56,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:55:56,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-10-22 08:55:56,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:56,748 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-22 08:55:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-10-22 08:55:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-10-22 08:55:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:55:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-10-22 08:55:56,775 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 08:55:56,775 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 08:55:56,775 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:56,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-10-22 08:55:56,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:55:56,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:56,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:56,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:55:56,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:56,777 INFO L791 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-10-22 08:55:56,778 INFO L793 eck$LassoCheckResult]: Loop: 168#L16-6 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 168#L16-6 [2019-10-22 08:55:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 32998, now seen corresponding path program 1 times [2019-10-22 08:55:56,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053129643] [2019-10-22 08:55:56,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,788 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2019-10-22 08:55:56,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712219599] [2019-10-22 08:55:56,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1023023, now seen corresponding path program 1 times [2019-10-22 08:55:56,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99723761] [2019-10-22 08:55:56,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:56,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:56,841 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:56,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:56,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:56,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:56,841 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:56,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:56,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:56,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:56,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration2_Lasso [2019-10-22 08:55:56,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:56,842 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:56,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,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-10-22 08:55:56,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,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-10-22 08:55:56,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,963 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:56,963 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:55:56,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:56,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:55:56,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:56,982 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:56,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:56,989 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:56,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:56,993 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,004 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:57,009 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,016 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,019 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:57,019 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,025 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:57,029 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,035 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,038 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:57,038 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,046 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:57,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:57,052 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:57,059 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:57,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:57,072 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:09,189 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 08:56:09,195 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:09,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:09,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:09,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:09,195 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:09,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:09,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:09,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:09,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration2_Lasso [2019-10-22 08:56:09,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:09,196 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:09,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-10-22 08:56:09,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,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-10-22 08:56:09,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,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-10-22 08:56:09,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,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-10-22 08:56:09,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-10-22 08:56:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,351 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:09,352 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:09,352 INFO L120 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-10-22 08:56:09,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:09,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:09,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:09,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:09,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:09,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:09,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:09,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:09,356 INFO L120 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-10-22 08:56:09,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:09,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:09,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:09,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:09,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:09,358 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:09,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:09,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:09,359 INFO L120 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-10-22 08:56:09,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:09,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:09,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:09,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:09,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:09,361 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:09,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:09,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:09,362 INFO L120 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-10-22 08:56:09,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:09,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:09,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:09,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:09,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:09,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:09,401 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:09,432 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:09,432 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:09,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:09,434 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:09,435 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:09,435 INFO L512 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-10-22 08:56:09,443 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:09,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:09,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:09,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:09,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:09,503 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-10-22 08:56:09,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:56:09,558 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-10-22 08:56:09,559 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-10-22 08:56:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:56:09,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2019-10-22 08:56:09,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:09,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2019-10-22 08:56:09,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:09,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:56:09,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:09,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-10-22 08:56:09,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-10-22 08:56:09,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 39 transitions. [2019-10-22 08:56:09,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:56:09,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:56:09,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-10-22 08:56:09,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:09,565 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:56:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-10-22 08:56:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:56:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:56:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-10-22 08:56:09,568 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:56:09,568 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:56:09,568 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:09,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-10-22 08:56:09,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:09,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:09,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:09,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:09,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:09,571 INFO L791 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-10-22 08:56:09,571 INFO L793 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-10-22 08:56:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1466276473, now seen corresponding path program 1 times [2019-10-22 08:56:09,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249077937] [2019-10-22 08:56:09,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,591 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 1 times [2019-10-22 08:56:09,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577152842] [2019-10-22 08:56:09,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,600 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 342419296, now seen corresponding path program 1 times [2019-10-22 08:56:09,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950214623] [2019-10-22 08:56:09,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,839 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:09,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:09,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:09,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:09,840 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:09,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:09,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:09,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:09,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration3_Lasso [2019-10-22 08:56:09,840 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:09,840 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:09,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,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-10-22 08:56:09,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,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-10-22 08:56:09,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:09,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:10,134 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:10,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:10,147 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:10,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:10,161 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:10,171 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:10,173 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:10,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:10,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:10,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:10,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:10,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:10,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:10,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:10,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration3_Lasso [2019-10-22 08:56:10,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:10,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:10,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,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-10-22 08:56:10,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,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-10-22 08:56:10,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:10,383 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:10,383 INFO L120 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-10-22 08:56:10,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:10,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:10,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:10,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:10,387 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:10,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:10,407 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:10,426 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 08:56:10,426 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:10,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:10,428 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:10,428 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:10,428 INFO L512 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-10-22 08:56:10,447 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:10,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:10,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:10,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:10,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:10,515 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-10-22 08:56:10,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:56:10,572 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-10-22 08:56:10,572 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-10-22 08:56:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-10-22 08:56:10,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:10,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:10,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:56:10,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:10,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:56:10,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:10,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:56:10,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:10,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2019-10-22 08:56:10,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:56:10,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:56:10,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-10-22 08:56:10,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:10,576 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-22 08:56:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-10-22 08:56:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-22 08:56:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:56:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-10-22 08:56:10,579 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 08:56:10,579 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 08:56:10,579 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:10,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-10-22 08:56:10,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:10,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:10,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:10,581 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:10,581 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:10,581 INFO L791 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-10-22 08:56:10,581 INFO L793 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-10-22 08:56:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash 925850489, now seen corresponding path program 1 times [2019-10-22 08:56:10,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:10,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158411444] [2019-10-22 08:56:10,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 1 times [2019-10-22 08:56:10,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:10,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18744320] [2019-10-22 08:56:10,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,601 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 684093600, now seen corresponding path program 1 times [2019-10-22 08:56:10,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:10,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237029572] [2019-10-22 08:56:10,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:10,619 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:10,788 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:10,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:10,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:10,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:10,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:10,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:10,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:10,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:10,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration4_Lasso [2019-10-22 08:56:10,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:10,789 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:10,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-10-22 08:56:10,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-10-22 08:56:10,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-10-22 08:56:10,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:10,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:11,046 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,055 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,055 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:11,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,071 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,092 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,092 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,097 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:11,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,127 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:11,128 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:11,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:11,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:11,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:11,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:11,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:11,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:11,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:11,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration4_Lasso [2019-10-22 08:56:11,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:11,129 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:11,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,319 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:11,319 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:11,319 INFO L120 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-10-22 08:56:11,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,324 INFO L120 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-10-22 08:56:11,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,327 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,327 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,331 INFO L120 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-10-22 08:56:11,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,333 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,333 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,336 INFO L120 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-10-22 08:56:11,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,338 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,344 INFO L120 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-10-22 08:56:11,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,359 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:11,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:11,364 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:56:11,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:11,366 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:11,366 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:11,367 INFO L512 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-10-22 08:56:11,379 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:11,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:11,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:11,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:11,458 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-10-22 08:56:11,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:56:11,510 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-10-22 08:56:11,512 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-10-22 08:56:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-10-22 08:56:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:56:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:56:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2019-10-22 08:56:11,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:11,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 44 transitions. [2019-10-22 08:56:11,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:56:11,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:56:11,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-10-22 08:56:11,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:11,516 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:56:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-10-22 08:56:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-22 08:56:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:56:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-10-22 08:56:11,524 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:56:11,524 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:56:11,524 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:11,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-10-22 08:56:11,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:11,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:11,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:11,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:11,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:11,526 INFO L791 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-10-22 08:56:11,526 INFO L793 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-10-22 08:56:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 342419292, now seen corresponding path program 1 times [2019-10-22 08:56:11,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:11,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106726065] [2019-10-22 08:56:11,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash 91200, now seen corresponding path program 1 times [2019-10-22 08:56:11,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:11,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881676839] [2019-10-22 08:56:11,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash 465861381, now seen corresponding path program 1 times [2019-10-22 08:56:11,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:11,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469932123] [2019-10-22 08:56:11,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:11,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:11,595 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:11,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:11,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:11,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:11,595 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:11,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:11,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:11,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:11,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration5_Loop [2019-10-22 08:56:11,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:11,596 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:11,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,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-10-22 08:56:11,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-10-22 08:56:11,731 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:11,731 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,739 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,740 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,753 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,753 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=128, ULTIMATE.start_f_~y~0=128} Honda state: {ULTIMATE.start_f_#t~nondet4=128, ULTIMATE.start_f_~y~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,758 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:11,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,776 INFO L440 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=-2}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=4}] Lambdas: [1, 1, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:11,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:11,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:11,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:11,793 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-152, ULTIMATE.start_f_~c~0=-152} Honda state: {ULTIMATE.start_f_#t~nondet3=-152, ULTIMATE.start_f_~c~0=-152} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-10-22 08:56:11,915 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:11,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:11,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:11,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:11,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:11,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:11,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:11,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:11,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration5_Lasso [2019-10-22 08:56:11,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:11,916 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:11,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,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-10-22 08:56:11,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:11,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-10-22 08:56:12,239 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:12,239 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:12,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:12,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:12,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=42} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:12,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,265 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:12,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:12,272 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:12,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,284 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:12,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:12,328 INFO L440 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=98381, ULTIMATE.start_f_~y~0=77} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:12,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,336 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:12,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:12,350 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:12,360 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:12,362 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:12,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:12,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:12,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:12,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:12,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:12,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:12,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:12,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration5_Lasso [2019-10-22 08:56:12,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:12,363 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:12,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,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-10-22 08:56:12,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,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-10-22 08:56:12,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,577 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:12,577 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:12,578 INFO L120 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-10-22 08:56:12,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:12,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:12,578 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:12,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:12,579 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:12,580 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:12,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:12,587 INFO L120 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-10-22 08:56:12,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:12,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:12,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:12,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:12,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:12,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:12,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:12,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:12,590 INFO L120 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-10-22 08:56:12,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:12,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:12,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:12,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:12,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:12,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:12,604 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:12,633 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:56:12,633 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:12,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:12,635 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:12,635 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:12,635 INFO L512 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-10-22 08:56:12,647 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:12,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:12,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:12,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:12,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:12,723 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-10-22 08:56:12,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-10-22 08:56:12,763 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-10-22 08:56:12,763 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-10-22 08:56:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:56:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-10-22 08:56:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:56:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:56:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:56:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:12,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-10-22 08:56:12,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:12,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 51 transitions. [2019-10-22 08:56:12,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:56:12,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:56:12,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-10-22 08:56:12,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:12,765 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-10-22 08:56:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-10-22 08:56:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-22 08:56:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 08:56:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2019-10-22 08:56:12,768 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-10-22 08:56:12,768 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-10-22 08:56:12,768 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:12,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2019-10-22 08:56:12,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:12,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:12,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:12,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:12,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:12,770 INFO L791 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-10-22 08:56:12,770 INFO L793 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-10-22 08:56:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 684093596, now seen corresponding path program 1 times [2019-10-22 08:56:12,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:12,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118363488] [2019-10-22 08:56:12,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,781 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 156738, now seen corresponding path program 1 times [2019-10-22 08:56:12,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:12,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898189830] [2019-10-22 08:56:12,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,787 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash 212625863, now seen corresponding path program 1 times [2019-10-22 08:56:12,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:12,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790225770] [2019-10-22 08:56:12,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:12,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:12,800 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:12,830 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:12,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:12,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:12,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:12,830 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:12,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:12,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:12,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:12,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration6_Loop [2019-10-22 08:56:12,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:12,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:12,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:12,962 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:12,963 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:12,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:12,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:12,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-224, ULTIMATE.start_f_~c~0=-224} Honda state: {ULTIMATE.start_f_#t~nondet3=-224, ULTIMATE.start_f_~c~0=-224} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:12,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:12,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:12,982 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:12,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:12,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:13,001 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:13,001 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=64, ULTIMATE.start_f_~y~0=64} Honda state: {ULTIMATE.start_f_#t~nondet4=64, ULTIMATE.start_f_~y~0=64} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:13,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:13,015 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:13,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:13,028 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:13,039 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:13,039 INFO L440 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=-2}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2019-10-22 08:56:13,148 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:13,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:13,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:13,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:13,149 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:13,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:13,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:13,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:13,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration6_Lasso [2019-10-22 08:56:13,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:13,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,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-10-22 08:56:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:13,349 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:13,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:13,354 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:13,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:13,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:13,367 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:13,368 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:13,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:13,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:13,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:13,369 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:13,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:13,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:13,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:13,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration6_Lasso [2019-10-22 08:56:13,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:13,369 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:13,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,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-10-22 08:56:13,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:13,555 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:13,555 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:13,556 INFO L120 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-10-22 08:56:13,556 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:13,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:13,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:13,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:13,558 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:13,558 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:13,568 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:13,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:13,573 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:56:13,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:13,575 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:13,575 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:13,575 INFO L512 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 - 2 >= 0] [2019-10-22 08:56:13,594 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:13,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:13,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:13,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:13,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:13,668 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-10-22 08:56:13,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-10-22 08:56:13,729 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-10-22 08:56:13,729 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-10-22 08:56:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:56:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-10-22 08:56:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:56:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:56:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:56:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:13,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-10-22 08:56:13,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:13,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 43 states and 58 transitions. [2019-10-22 08:56:13,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:56:13,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:56:13,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2019-10-22 08:56:13,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:13,735 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-22 08:56:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2019-10-22 08:56:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-22 08:56:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 08:56:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2019-10-22 08:56:13,738 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-10-22 08:56:13,738 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2019-10-22 08:56:13,738 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:13,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2019-10-22 08:56:13,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:13,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:13,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:13,740 INFO L791 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-10-22 08:56:13,741 INFO L793 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-10-22 08:56:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 465861385, now seen corresponding path program 1 times [2019-10-22 08:56:13,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058591014] [2019-10-22 08:56:13,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,757 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 2 times [2019-10-22 08:56:13,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522298434] [2019-10-22 08:56:13,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,764 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1016194032, now seen corresponding path program 2 times [2019-10-22 08:56:13,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864004916] [2019-10-22 08:56:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,927 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-22 08:56:13,990 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:13,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:13,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:13,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:13,991 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:13,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:13,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:13,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:13,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration7_Lasso [2019-10-22 08:56:13,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:13,991 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:13,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-10-22 08:56:13,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,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-10-22 08:56:14,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,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-10-22 08:56:14,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,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-10-22 08:56:14,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,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-10-22 08:56:14,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-10-22 08:56:14,240 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:14,240 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:14,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:14,247 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,254 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:14,255 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:14,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:14,261 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,277 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:14,277 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:14,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:14,285 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:14,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:14,297 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,309 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:14,311 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:14,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:14,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:14,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:14,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:14,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:14,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:14,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration7_Lasso [2019-10-22 08:56:14,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:14,312 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:14,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-10-22 08:56:14,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,609 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:14,609 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:14,609 INFO L120 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-10-22 08:56:14,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,623 INFO L120 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-10-22 08:56:14,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,625 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,625 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,637 INFO L120 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-10-22 08:56:14,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,639 INFO L120 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-10-22 08:56:14,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,647 INFO L120 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-10-22 08:56:14,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,649 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,649 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,656 INFO L120 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-10-22 08:56:14,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,658 INFO L120 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-10-22 08:56:14,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,660 INFO L120 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-10-22 08:56:14,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,662 INFO L120 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-10-22 08:56:14,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,700 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:14,731 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:14,742 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:14,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:14,743 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:14,743 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:14,743 INFO L512 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-10-22 08:56:14,751 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:14,819 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-10-22 08:56:14,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 57 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-10-22 08:56:14,863 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-10-22 08:56:14,864 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-10-22 08:56:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:56:14,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:14,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:14,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:56:14,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:14,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-10-22 08:56:14,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:14,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 52 states and 69 transitions. [2019-10-22 08:56:14,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:56:14,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:56:14,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2019-10-22 08:56:14,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:14,868 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-10-22 08:56:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2019-10-22 08:56:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-22 08:56:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 08:56:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2019-10-22 08:56:14,875 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-10-22 08:56:14,875 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-10-22 08:56:14,875 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:14,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2019-10-22 08:56:14,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:14,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:14,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:14,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:14,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:14,876 INFO L791 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-10-22 08:56:14,876 INFO L793 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-10-22 08:56:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash 212625867, now seen corresponding path program 1 times [2019-10-22 08:56:14,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027012124] [2019-10-22 08:56:14,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 2 times [2019-10-22 08:56:14,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467273200] [2019-10-22 08:56:14,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1824968078, now seen corresponding path program 2 times [2019-10-22 08:56:14,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601765816] [2019-10-22 08:56:14,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,038 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-22 08:56:15,089 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:15,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:15,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:15,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:15,090 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:15,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:15,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:15,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:15,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration8_Lasso [2019-10-22 08:56:15,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:15,090 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:15,312 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,317 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,317 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=-809472} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,328 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,343 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,350 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,351 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,358 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,358 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,369 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:15,375 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:15,380 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:15,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:15,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:15,406 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:15,408 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:15,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:15,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:15,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:15,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:15,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:15,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:15,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:15,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration8_Lasso [2019-10-22 08:56:15,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:15,409 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:15,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,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-10-22 08:56:15,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-10-22 08:56:15,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-10-22 08:56:15,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-10-22 08:56:15,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,624 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:15,624 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:15,625 INFO L120 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-10-22 08:56:15,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,629 INFO L120 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-10-22 08:56:15,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,633 INFO L120 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-10-22 08:56:15,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:15,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:15,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:15,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,635 INFO L120 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-10-22 08:56:15,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,636 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,638 INFO L120 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-10-22 08:56:15,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,640 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,640 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,641 INFO L120 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-10-22 08:56:15,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,644 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,644 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:15,647 INFO L120 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-10-22 08:56:15,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:15,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:15,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:15,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:15,649 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:15,649 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:15,666 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:15,677 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:15,677 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:15,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:15,678 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:15,679 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:15,679 INFO L512 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-10-22 08:56:15,689 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:15,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:15,746 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-10-22 08:56:15,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 67 transitions. cyclomatic complexity: 27 Second operand 4 states. [2019-10-22 08:56:15,779 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-10-22 08:56:15,779 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-10-22 08:56:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:56:15,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:15,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:15,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:56:15,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2019-10-22 08:56:15,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:15,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 79 transitions. [2019-10-22 08:56:15,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:56:15,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:56:15,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-10-22 08:56:15,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:15,783 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-10-22 08:56:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-10-22 08:56:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-22 08:56:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 08:56:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-10-22 08:56:15,786 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-10-22 08:56:15,787 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-10-22 08:56:15,787 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:56:15,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2019-10-22 08:56:15,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:15,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:15,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:15,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:15,789 INFO L791 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-10-22 08:56:15,789 INFO L793 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-10-22 08:56:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1126180482, now seen corresponding path program 3 times [2019-10-22 08:56:15,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195308440] [2019-10-22 08:56:15,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,801 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2792, now seen corresponding path program 3 times [2019-10-22 08:56:15,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282125402] [2019-10-22 08:56:15,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,806 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash -72313559, now seen corresponding path program 4 times [2019-10-22 08:56:15,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981254069] [2019-10-22 08:56:15,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,822 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,009 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-22 08:56:16,088 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:16,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:16,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:16,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:16,088 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:16,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:16,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:16,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:16,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration9_Lasso [2019-10-22 08:56:16,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:16,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:16,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,289 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:16,289 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:16,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:16,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:16,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:16,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=-809472} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:16,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:16,302 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:16,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:16,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:16,317 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:16,319 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:16,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:16,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:16,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:16,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:16,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:16,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:16,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:16,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration9_Lasso [2019-10-22 08:56:16,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:16,319 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:16,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,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-10-22 08:56:16,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-10-22 08:56:16,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,541 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:16,542 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:16,542 INFO L120 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-10-22 08:56:16,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,551 INFO L120 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-10-22 08:56:16,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,553 INFO L120 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-10-22 08:56:16,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,561 INFO L120 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-10-22 08:56:16,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,563 INFO L120 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-10-22 08:56:16,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,565 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,565 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,569 INFO L120 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-10-22 08:56:16,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,574 INFO L120 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-10-22 08:56:16,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,603 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,603 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,604 INFO L120 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-10-22 08:56:16,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,611 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,632 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:16,655 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:16,658 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:16,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:16,660 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:16,660 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:16,660 INFO L512 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-10-22 08:56:16,664 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,716 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-10-22 08:56:16,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-10-22 08:56:16,748 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-10-22 08:56:16,748 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-10-22 08:56:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:56:16,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:16,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,749 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:16,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,795 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-10-22 08:56:16,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-10-22 08:56:16,835 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-10-22 08:56:16,836 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-10-22 08:56:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:56:16,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:16,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,836 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,913 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-10-22 08:56:16,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-10-22 08:56:16,942 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-10-22 08:56:16,943 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-10-22 08:56:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2019-10-22 08:56:16,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:16,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 18 letters. Loop has 2 letters. [2019-10-22 08:56:16,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 08:56:16,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2019-10-22 08:56:16,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 30 states and 39 transitions. [2019-10-22 08:56:16,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:56:16,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:56:16,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-10-22 08:56:16,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:16,946 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:56:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-10-22 08:56:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 08:56:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:56:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 08:56:16,948 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:56:16,948 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:56:16,949 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:56:16,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-10-22 08:56:16,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:16,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:16,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:16,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:16,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:16,951 INFO L791 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-10-22 08:56:16,951 INFO L793 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-10-22 08:56:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1714981628, now seen corresponding path program 3 times [2019-10-22 08:56:16,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754240390] [2019-10-22 08:56:16,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 4904, now seen corresponding path program 3 times [2019-10-22 08:56:16,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176989206] [2019-10-22 08:56:16,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1170101099, now seen corresponding path program 4 times [2019-10-22 08:56:16,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:16,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192227091] [2019-10-22 08:56:16,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:16,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:16,983 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:17,175 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-22 08:56:17,291 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:17,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:17,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:17,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:17,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:17,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:17,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:17,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:17,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration10_Lasso [2019-10-22 08:56:17,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:17,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:17,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,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-10-22 08:56:17,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,488 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:17,488 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/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-10-22 08:56:17,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:17,493 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c3da433-417e-4926-8616-260c9a091651/bin/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:17,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:17,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:17,510 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:17,511 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:17,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:17,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:17,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:17,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:17,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:17,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:17,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:17,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01-2.i_Iteration10_Lasso [2019-10-22 08:56:17,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:17,512 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:17,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,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-10-22 08:56:17,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,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-10-22 08:56:17,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,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-10-22 08:56:17,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:17,693 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:17,693 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:17,694 INFO L120 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-10-22 08:56:17,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,694 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,696 INFO L120 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-10-22 08:56:17,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,697 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,698 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,701 INFO L120 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-10-22 08:56:17,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,703 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,704 INFO L120 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-10-22 08:56:17,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,706 INFO L120 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-10-22 08:56:17,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,708 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,710 INFO L120 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-10-22 08:56:17,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,712 INFO L120 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-10-22 08:56:17,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,714 INFO L120 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-10-22 08:56:17,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,716 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,716 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,718 INFO L120 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-10-22 08:56:17,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:17,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,720 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:17,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:17,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,720 INFO L120 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-10-22 08:56:17,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,722 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:17,724 INFO L120 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-10-22 08:56:17,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:17,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:17,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:17,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:17,726 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:17,726 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:17,738 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:17,747 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:17,747 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:17,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:17,748 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:17,748 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:17,749 INFO L512 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-10-22 08:56:17,767 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,835 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-10-22 08:56:17,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:56:17,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 38 states and 47 transitions. Complement of second has 6 states. [2019-10-22 08:56:17,859 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-10-22 08:56:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:56:17,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:17,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,860 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,917 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-10-22 08:56:17,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:56:17,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 38 states and 47 transitions. Complement of second has 6 states. [2019-10-22 08:56:17,945 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-10-22 08:56:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:56:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:17,947 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:17,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:18,000 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-10-22 08:56:18,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:56:18,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 41 states and 52 transitions. Complement of second has 5 states. [2019-10-22 08:56:18,025 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-10-22 08:56:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:56:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:18,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 18 letters. Loop has 2 letters. [2019-10-22 08:56:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 08:56:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:18,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-10-22 08:56:18,027 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:18,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 08:56:18,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:18,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:18,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:18,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:18,027 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:18,027 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:18,027 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:18,027 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:56:18,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:18,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:18,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:18,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:18 BoogieIcfgContainer [2019-10-22 08:56:18,035 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:18,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:18,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:18,036 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:18,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:43" (3/4) ... [2019-10-22 08:56:18,039 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:18,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:18,040 INFO L168 Benchmark]: Toolchain (without parser) took 35234.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -128.5 MB). Peak memory consumption was 258.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:18,041 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:18,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:18,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:18,045 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:18,045 INFO L168 Benchmark]: RCFGBuilder took 241.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:18,045 INFO L168 Benchmark]: BuchiAutomizer took 34693.22 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 281.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:18,046 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:18,047 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34693.22 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 281.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 + -1 * d 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 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.6s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 32.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. 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, 486 SDslu, 85 SDs, 0 SdLazy, 150 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf97 lsp44 ukn100 mio100 lsp100 div284 bol100 ite100 ukn100 eq148 hnf49 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: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 24.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...