./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 64bit --witnessprinter.graph.data.programhash 4f5dfa3dfde4da491a923b915452cddcc4ed5c87 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:04:19,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:04:19,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:04:19,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:04:19,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:04:19,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:04:19,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:04:19,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:04:19,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:04:19,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:04:19,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:04:19,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:04:19,687 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:04:19,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:04:19,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:04:19,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:04:19,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:04:19,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:04:19,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:04:19,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:04:19,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:04:19,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:04:19,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:04:19,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:04:19,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:04:19,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:04:19,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:04:19,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:04:19,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:04:19,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:04:19,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:04:19,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:04:19,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:04:19,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:04:19,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:04:19,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:04:19,702 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:04:19,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:04:19,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:04:19,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:04:19,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:04:19,714 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:04:19,714 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:04:19,714 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:04:19,714 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:04:19,714 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:04:19,714 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:04:19,715 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:04:19,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:04:19,715 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:04:19,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:04:19,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:04:19,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:04:19,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:04:19,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:04:19,717 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:04:19,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:04:19,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:04:19,717 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:04:19,718 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:04:19,718 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f5dfa3dfde4da491a923b915452cddcc4ed5c87 [2018-11-10 07:04:19,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:04:19,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:04:19,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:04:19,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:04:19,754 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:04:19,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2018-11-10 07:04:19,799 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/data/ffcd42e6c/822ecff633c84b33bf1bb7563b16fec5/FLAG4d8c2f339 [2018-11-10 07:04:20,098 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:04:20,098 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2018-11-10 07:04:20,102 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/data/ffcd42e6c/822ecff633c84b33bf1bb7563b16fec5/FLAG4d8c2f339 [2018-11-10 07:04:20,110 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/data/ffcd42e6c/822ecff633c84b33bf1bb7563b16fec5 [2018-11-10 07:04:20,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:04:20,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:04:20,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:04:20,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:04:20,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:04:20,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21842996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20, skipping insertion in model container [2018-11-10 07:04:20,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:04:20,133 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:04:20,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:04:20,229 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:04:20,238 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:04:20,246 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:04:20,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20 WrapperNode [2018-11-10 07:04:20,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:04:20,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:04:20,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:04:20,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:04:20,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:04:20,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:04:20,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:04:20,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:04:20,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... [2018-11-10 07:04:20,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:04:20,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:04:20,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:04:20,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:04:20,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:04:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:04:20,443 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:04:20,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:04:20 BoogieIcfgContainer [2018-11-10 07:04:20,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:04:20,444 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:04:20,444 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:04:20,447 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:04:20,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:04:20,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:04:20" (1/3) ... [2018-11-10 07:04:20,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73bd2e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:04:20, skipping insertion in model container [2018-11-10 07:04:20,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:04:20,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:20" (2/3) ... [2018-11-10 07:04:20,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73bd2e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:04:20, skipping insertion in model container [2018-11-10 07:04:20,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:04:20,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:04:20" (3/3) ... [2018-11-10 07:04:20,451 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2018-11-10 07:04:20,496 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:04:20,497 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:04:20,497 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:04:20,497 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:04:20,497 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:04:20,497 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:04:20,498 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:04:20,498 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:04:20,498 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:04:20,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 07:04:20,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:04:20,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:20,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:20,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:04:20,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:04:20,527 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:04:20,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 07:04:20,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:04:20,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:20,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:20,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:04:20,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:04:20,535 INFO L793 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 13#L17-3true [2018-11-10 07:04:20,535 INFO L795 eck$LassoCheckResult]: Loop: 13#L17-3true assume true; 6#L17-1true assume !!(main_~i~0 < 5);main_~j~0 := 0; 7#L19-3true assume !true; 4#L19-4true main_~i~0 := main_~i~0 + 1; 13#L17-3true [2018-11-10 07:04:20,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:04:20,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:20,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1114569, now seen corresponding path program 1 times [2018-11-10 07:04:20,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:20,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:04:20,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:04:20,626 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:04:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:04:20,636 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2018-11-10 07:04:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:20,640 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-10 07:04:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:04:20,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-10 07:04:20,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:04:20,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-11-10 07:04:20,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 07:04:20,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 07:04:20,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-10 07:04:20,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:04:20,646 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:04:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-10 07:04:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-10 07:04:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:04:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-10 07:04:20,663 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:04:20,663 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 07:04:20,663 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:04:20,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-10 07:04:20,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:04:20,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:20,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:20,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:04:20,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:04:20,664 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 31#L17-3 [2018-11-10 07:04:20,664 INFO L795 eck$LassoCheckResult]: Loop: 31#L17-3 assume true; 34#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 35#L19-3 assume true; 36#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 32#L19-4 main_~i~0 := main_~i~0 + 1; 31#L17-3 [2018-11-10 07:04:20,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 07:04:20,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:20,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:20,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 34543791, now seen corresponding path program 1 times [2018-11-10 07:04:20,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:20,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:20,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:20,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1805983277, now seen corresponding path program 1 times [2018-11-10 07:04:20,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:20,737 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:20,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:20,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:20,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:20,738 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:04:20,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:20,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:20,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:20,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 07:04:20,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:20,739 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:20,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,824 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:20,824 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:20,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:20,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:20,847 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:20,847 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:20,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:20,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:20,871 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:20,871 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:20,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:20,879 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:20,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:04:20,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:20,921 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:04:20,923 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:20,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:20,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:20,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:20,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:04:20,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:20,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:20,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:20,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 07:04:20,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:20,923 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:20,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:20,980 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:20,983 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:04:20,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:20,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:20,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:20,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:20,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:20,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:20,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:20,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:20,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:20,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:20,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:20,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:20,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:20,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:20,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:20,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:20,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:20,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:20,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:21,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:21,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:21,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:21,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:21,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:21,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:21,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:21,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:21,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:21,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:21,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:21,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:21,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:21,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:21,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:04:21,020 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:04:21,020 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:04:21,021 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:04:21,021 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:04:21,022 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:04:21,022 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2018-11-10 07:04:21,023 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:04:21,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:04:21,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 07:04:21,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2018-11-10 07:04:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:04:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 07:04:21,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 07:04:21,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:21,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 07:04:21,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:21,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 07:04:21,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:21,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-10 07:04:21,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:04:21,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2018-11-10 07:04:21,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 07:04:21,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 07:04:21,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-10 07:04:21,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,153 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 07:04:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-10 07:04:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-10 07:04:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 07:04:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-10 07:04:21,155 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-10 07:04:21,155 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-10 07:04:21,155 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:04:21,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-10 07:04:21,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:04:21,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 07:04:21,156 INFO L793 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L17-3 assume true; 118#L17-1 [2018-11-10 07:04:21,157 INFO L795 eck$LassoCheckResult]: Loop: 118#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 113#L19-3 assume true; 114#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 120#L19-3 assume true; 123#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 107#L19-4 main_~i~0 := main_~i~0 + 1; 108#L17-3 assume true; 118#L17-1 [2018-11-10 07:04:21,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-10 07:04:21,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:21,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash -13166815, now seen corresponding path program 1 times [2018-11-10 07:04:21,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,195 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 07:04:21,222 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:04:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:04:21,223 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 07:04:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,232 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-10 07:04:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:04:21,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-10 07:04:21,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 07:04:21,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-11-10 07:04:21,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 07:04:21,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 07:04:21,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-10 07:04:21,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,234 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 07:04:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-10 07:04:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-10 07:04:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:04:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-10 07:04:21,236 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-10 07:04:21,236 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-10 07:04:21,236 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:04:21,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-10 07:04:21,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 07:04:21,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-11-10 07:04:21,237 INFO L793 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 177#L17-3 assume true; 183#L17-1 [2018-11-10 07:04:21,237 INFO L795 eck$LassoCheckResult]: Loop: 183#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 184#L19-3 assume true; 187#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 190#L19-3 assume true; 195#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 194#L19-3 assume true; 193#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 178#L19-4 main_~i~0 := main_~i~0 + 1; 179#L17-3 assume true; 183#L17-1 [2018-11-10 07:04:21,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-10 07:04:21,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 233156071, now seen corresponding path program 2 times [2018-11-10 07:04:21,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,269 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:04:21,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:04:21,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:21,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 07:04:21,320 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:04:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:04:21,321 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-10 07:04:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,341 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-10 07:04:21,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:04:21,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-10 07:04:21,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:04:21,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2018-11-10 07:04:21,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 07:04:21,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 07:04:21,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2018-11-10 07:04:21,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,342 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-10 07:04:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2018-11-10 07:04:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-10 07:04:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 07:04:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-10 07:04:21,344 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 07:04:21,344 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 07:04:21,344 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:04:21,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-10 07:04:21,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:04:21,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2018-11-10 07:04:21,345 INFO L793 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 265#L17-3 assume true; 267#L17-1 [2018-11-10 07:04:21,345 INFO L795 eck$LassoCheckResult]: Loop: 267#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 268#L19-3 assume true; 271#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 274#L19-3 assume true; 280#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 279#L19-3 assume true; 278#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 277#L19-3 assume true; 276#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 260#L19-4 main_~i~0 := main_~i~0 + 1; 261#L17-3 assume true; 267#L17-1 [2018-11-10 07:04:21,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 3 times [2018-11-10 07:04:21,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 726248237, now seen corresponding path program 3 times [2018-11-10 07:04:21,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,388 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:04:21,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 07:04:21,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:21,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 07:04:21,452 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:04:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:04:21,453 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-10 07:04:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,476 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-10 07:04:21,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:04:21,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-11-10 07:04:21,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:04:21,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 07:04:21,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 07:04:21,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 07:04:21,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2018-11-10 07:04:21,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,478 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 07:04:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2018-11-10 07:04:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-10 07:04:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 07:04:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-10 07:04:21,481 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 07:04:21,481 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 07:04:21,481 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:04:21,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-11-10 07:04:21,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:04:21,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2018-11-10 07:04:21,482 INFO L793 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 362#L17-3 assume true; 368#L17-1 [2018-11-10 07:04:21,482 INFO L795 eck$LassoCheckResult]: Loop: 368#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 369#L19-3 assume true; 372#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 375#L19-3 assume true; 384#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 383#L19-3 assume true; 382#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 381#L19-3 assume true; 380#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 379#L19-3 assume true; 378#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 363#L19-4 main_~i~0 := main_~i~0 + 1; 364#L17-3 assume true; 368#L17-1 [2018-11-10 07:04:21,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 4 times [2018-11-10 07:04:21,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2141417203, now seen corresponding path program 4 times [2018-11-10 07:04:21,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,533 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:04:21,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:04:21,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:21,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:04:21,584 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:04:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:04:21,585 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 07:04:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,600 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 07:04:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:04:21,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 07:04:21,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:04:21,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2018-11-10 07:04:21,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 07:04:21,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 07:04:21,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2018-11-10 07:04:21,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,602 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-10 07:04:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2018-11-10 07:04:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-10 07:04:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:04:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 07:04:21,605 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:04:21,605 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:04:21,605 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:04:21,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 07:04:21,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:04:21,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2018-11-10 07:04:21,606 INFO L793 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 480#L17-3 assume true; 485#L17-1 [2018-11-10 07:04:21,606 INFO L795 eck$LassoCheckResult]: Loop: 485#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 481#L19-3 assume true; 482#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 489#L19-3 assume true; 500#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 499#L19-3 assume true; 498#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 497#L19-3 assume true; 496#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 495#L19-3 assume true; 494#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 493#L19-3 assume true; 492#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 475#L19-4 main_~i~0 := main_~i~0 + 1; 476#L17-3 assume true; 485#L17-1 [2018-11-10 07:04:21,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 5 times [2018-11-10 07:04:21,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,610 INFO L82 PathProgramCache]: Analyzing trace with hash 614160697, now seen corresponding path program 5 times [2018-11-10 07:04:21,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 07:04:21,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 07:04:21,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:21,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-10 07:04:21,737 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:04:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:04:21,738 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-10 07:04:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,765 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-10 07:04:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:04:21,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-11-10 07:04:21,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 07:04:21,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2018-11-10 07:04:21,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 07:04:21,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 07:04:21,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-10 07:04:21,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,767 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-10 07:04:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-10 07:04:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-10 07:04:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 07:04:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-10 07:04:21,770 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 07:04:21,770 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 07:04:21,770 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:04:21,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-10 07:04:21,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 07:04:21,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2018-11-10 07:04:21,771 INFO L793 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 611#L17-3 assume true; 616#L17-1 [2018-11-10 07:04:21,771 INFO L795 eck$LassoCheckResult]: Loop: 616#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 612#L19-3 assume true; 613#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 620#L19-3 assume true; 633#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 632#L19-3 assume true; 631#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 630#L19-3 assume true; 629#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 628#L19-3 assume true; 627#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 626#L19-3 assume true; 625#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 624#L19-3 assume true; 623#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 606#L19-4 main_~i~0 := main_~i~0 + 1; 607#L17-3 assume true; 616#L17-1 [2018-11-10 07:04:21,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 6 times [2018-11-10 07:04:21,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1799473663, now seen corresponding path program 6 times [2018-11-10 07:04:21,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:21,859 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 07:04:21,870 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 07:04:21,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:21,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:21,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:21,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-10 07:04:21,903 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:04:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:04:21,903 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-10 07:04:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:21,917 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 07:04:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:04:21,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 50 transitions. [2018-11-10 07:04:21,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 07:04:21,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 50 transitions. [2018-11-10 07:04:21,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:04:21,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 07:04:21,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2018-11-10 07:04:21,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:21,919 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-10 07:04:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2018-11-10 07:04:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-10 07:04:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 07:04:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-10 07:04:21,921 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 07:04:21,921 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 07:04:21,921 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:04:21,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2018-11-10 07:04:21,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 07:04:21,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:21,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:21,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:21,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2018-11-10 07:04:21,923 INFO L793 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 753#L17-3 assume true; 759#L17-1 [2018-11-10 07:04:21,923 INFO L795 eck$LassoCheckResult]: Loop: 759#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 760#L19-3 assume true; 763#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 766#L19-3 assume true; 781#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 780#L19-3 assume true; 779#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 778#L19-3 assume true; 777#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 776#L19-3 assume true; 775#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 774#L19-3 assume true; 773#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 772#L19-3 assume true; 771#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 770#L19-3 assume true; 769#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 754#L19-4 main_~i~0 := main_~i~0 + 1; 755#L17-3 assume true; 759#L17-1 [2018-11-10 07:04:21,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 7 times [2018-11-10 07:04:21,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:21,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1576066747, now seen corresponding path program 7 times [2018-11-10 07:04:21,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:21,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:21,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:22,006 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:22,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 07:04:22,042 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:04:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:04:22,043 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-10 07:04:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:22,070 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-10 07:04:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:04:22,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2018-11-10 07:04:22,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 07:04:22,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 54 transitions. [2018-11-10 07:04:22,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 07:04:22,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 07:04:22,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2018-11-10 07:04:22,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:22,072 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 07:04:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2018-11-10 07:04:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-10 07:04:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 07:04:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-10 07:04:22,075 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-10 07:04:22,075 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-10 07:04:22,075 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:04:22,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2018-11-10 07:04:22,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 07:04:22,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:22,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:22,076 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:22,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2018-11-10 07:04:22,076 INFO L793 eck$LassoCheckResult]: Stem: 921#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 915#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 916#L17-3 assume true; 922#L17-1 [2018-11-10 07:04:22,076 INFO L795 eck$LassoCheckResult]: Loop: 922#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 917#L19-3 assume true; 918#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 925#L19-3 assume true; 941#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 940#L19-3 assume true; 939#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 938#L19-3 assume true; 937#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 936#L19-3 assume true; 935#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 934#L19-3 assume true; 933#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 932#L19-3 assume true; 931#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 930#L19-3 assume true; 929#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 928#L19-3 assume true; 927#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 911#L19-4 main_~i~0 := main_~i~0 + 1; 912#L17-3 assume true; 922#L17-1 [2018-11-10 07:04:22,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 8 times [2018-11-10 07:04:22,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1524875019, now seen corresponding path program 8 times [2018-11-10 07:04:22,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:22,147 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:22,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:04:22,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:04:22,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:22,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:22,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 07:04:22,182 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:04:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:04:22,182 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-10 07:04:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:22,208 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-10 07:04:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:04:22,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 58 transitions. [2018-11-10 07:04:22,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 07:04:22,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 58 transitions. [2018-11-10 07:04:22,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 07:04:22,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 07:04:22,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. [2018-11-10 07:04:22,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:22,209 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 07:04:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. [2018-11-10 07:04:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-10 07:04:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 07:04:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-10 07:04:22,211 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-10 07:04:22,211 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-10 07:04:22,211 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:04:22,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 56 transitions. [2018-11-10 07:04:22,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 07:04:22,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:22,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:22,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:22,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2018-11-10 07:04:22,213 INFO L793 eck$LassoCheckResult]: Stem: 1091#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 1086#L17-3 assume true; 1092#L17-1 [2018-11-10 07:04:22,213 INFO L795 eck$LassoCheckResult]: Loop: 1092#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 1093#L19-3 assume true; 1096#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1099#L19-3 assume true; 1118#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1117#L19-3 assume true; 1116#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1115#L19-3 assume true; 1114#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1113#L19-3 assume true; 1112#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1111#L19-3 assume true; 1110#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1109#L19-3 assume true; 1108#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1107#L19-3 assume true; 1106#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1105#L19-3 assume true; 1104#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1103#L19-3 assume true; 1102#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 1087#L19-4 main_~i~0 := main_~i~0 + 1; 1088#L17-3 assume true; 1092#L17-1 [2018-11-10 07:04:22,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 9 times [2018-11-10 07:04:22,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 822608721, now seen corresponding path program 9 times [2018-11-10 07:04:22,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:04:22,294 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:04:22,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:04:22,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 07:04:22,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:04:22,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:22,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:04:22,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-10 07:04:22,401 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:04:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 07:04:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:04:22,401 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. cyclomatic complexity: 7 Second operand 20 states. [2018-11-10 07:04:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:04:22,430 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-10 07:04:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 07:04:22,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-11-10 07:04:22,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 07:04:22,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 62 transitions. [2018-11-10 07:04:22,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 07:04:22,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 07:04:22,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 62 transitions. [2018-11-10 07:04:22,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:22,432 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 07:04:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 62 transitions. [2018-11-10 07:04:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-10 07:04:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 07:04:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-10 07:04:22,435 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-10 07:04:22,435 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-10 07:04:22,435 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:04:22,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2018-11-10 07:04:22,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 07:04:22,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:22,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:22,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:04:22,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2018-11-10 07:04:22,438 INFO L793 eck$LassoCheckResult]: Stem: 1288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 1283#L17-3 assume true; 1289#L17-1 [2018-11-10 07:04:22,438 INFO L795 eck$LassoCheckResult]: Loop: 1289#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 1290#L19-3 assume true; 1293#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1296#L19-3 assume true; 1317#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1316#L19-3 assume true; 1315#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1314#L19-3 assume true; 1313#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1312#L19-3 assume true; 1311#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1310#L19-3 assume true; 1309#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1308#L19-3 assume true; 1307#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1306#L19-3 assume true; 1305#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1304#L19-3 assume true; 1303#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1302#L19-3 assume true; 1301#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1300#L19-3 assume true; 1299#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 1284#L19-4 main_~i~0 := main_~i~0 + 1; 1285#L17-3 assume true; 1289#L17-1 [2018-11-10 07:04:22,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 10 times [2018-11-10 07:04:22,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 254561815, now seen corresponding path program 10 times [2018-11-10 07:04:22,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1268976715, now seen corresponding path program 1 times [2018-11-10 07:04:22,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,538 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:22,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:22,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:22,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:22,538 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:04:22,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:22,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:22,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 07:04:22,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:22,538 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:22,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,573 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:22,573 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,593 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:22,594 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,602 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:22,602 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=10} Honda state: {ULTIMATE.start_main_~j~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,636 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:22,636 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,639 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:04:22,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,665 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:04:22,680 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:22,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:22,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:22,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:22,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:04:22,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:22,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:22,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 07:04:22,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:22,680 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:22,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,725 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:22,725 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:04:22,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:22,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:22,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:22,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:22,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:22,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:22,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:22,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:22,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:22,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:22,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:22,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:22,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:22,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:22,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:22,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:22,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:22,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:22,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:22,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:22,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:22,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:22,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:22,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:22,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:22,743 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:04:22,744 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:04:22,744 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:04:22,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:04:22,745 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:04:22,745 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:04:22,745 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-11-10 07:04:22,745 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:04:22,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:22,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 07:04:22,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:04:22,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 07:04:22,811 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 60 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 109 states and 120 transitions. Complement of second has 6 states. [2018-11-10 07:04:22,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:04:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-10 07:04:22,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 25 letters. [2018-11-10 07:04:22,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:22,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 28 letters. Loop has 25 letters. [2018-11-10 07:04:22,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:22,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 50 letters. [2018-11-10 07:04:22,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:22,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 120 transitions. [2018-11-10 07:04:22,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:04:22,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 83 states and 91 transitions. [2018-11-10 07:04:22,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 07:04:22,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 07:04:22,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 91 transitions. [2018-11-10 07:04:22,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:22,817 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-10 07:04:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 91 transitions. [2018-11-10 07:04:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2018-11-10 07:04:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 07:04:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-10 07:04:22,820 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 07:04:22,820 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 07:04:22,820 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:04:22,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-11-10 07:04:22,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:04:22,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:22,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:22,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:04:22,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 07:04:22,821 INFO L793 eck$LassoCheckResult]: Stem: 1565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1556#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 1557#L17-3 assume true; 1568#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 1558#L19-3 [2018-11-10 07:04:22,821 INFO L795 eck$LassoCheckResult]: Loop: 1558#L19-3 assume true; 1559#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1558#L19-3 [2018-11-10 07:04:22,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 925641, now seen corresponding path program 1 times [2018-11-10 07:04:22,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:22,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 1 times [2018-11-10 07:04:22,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:22,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 889541519, now seen corresponding path program 1 times [2018-11-10 07:04:22,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:22,844 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:22,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:22,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:22,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:22,844 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:04:22,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:22,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:22,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 07:04:22,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:22,845 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:22,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:22,874 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:22,875 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,907 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:22,907 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=3} Honda state: {ULTIMATE.start_main_~i~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:22,940 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:22,940 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:22,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:22,947 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:22,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:04:22,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:23,002 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:04:23,004 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:23,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:23,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:23,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:23,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:04:23,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:23,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:23,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:23,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 07:04:23,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:23,005 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:23,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,040 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:23,040 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:04:23,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:23,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:23,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:23,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:23,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:23,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:23,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:23,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:23,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:23,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:23,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:04:23,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:04:23,050 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:04:23,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:04:23,050 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:04:23,050 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:04:23,050 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2018-11-10 07:04:23,050 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:04:23,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:23,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:04:23,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-10 07:04:23,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 151 states and 168 transitions. Complement of second has 5 states. [2018-11-10 07:04:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:04:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:04:23,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-10 07:04:23,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-10 07:04:23,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-10 07:04:23,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 168 transitions. [2018-11-10 07:04:23,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:04:23,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 118 states and 131 transitions. [2018-11-10 07:04:23,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 07:04:23,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 07:04:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 131 transitions. [2018-11-10 07:04:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:04:23,086 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-11-10 07:04:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 131 transitions. [2018-11-10 07:04:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2018-11-10 07:04:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 07:04:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-11-10 07:04:23,092 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-11-10 07:04:23,092 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-11-10 07:04:23,092 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:04:23,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 116 transitions. [2018-11-10 07:04:23,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 07:04:23,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:04:23,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:04:23,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-10 07:04:23,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 07:04:23,093 INFO L793 eck$LassoCheckResult]: Stem: 1814#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1805#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 1806#L17-3 assume true; 1812#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 1813#L19-3 assume true; 1815#L19-1 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 1816#L19-4 main_~i~0 := main_~i~0 + 1; 1821#L17-3 assume true; 1818#L17-1 assume !!(main_~i~0 < 5);main_~j~0 := 0; 1807#L19-3 [2018-11-10 07:04:23,093 INFO L795 eck$LassoCheckResult]: Loop: 1807#L19-3 assume true; 1808#L19-1 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := main_~j~0 + 1; 1807#L19-3 [2018-11-10 07:04:23,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 383141811, now seen corresponding path program 2 times [2018-11-10 07:04:23,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:23,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:04:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 2 times [2018-11-10 07:04:23,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:23,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1167906567, now seen corresponding path program 2 times [2018-11-10 07:04:23,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:04:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:04:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:04:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:04:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:04:23,118 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:23,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:23,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:23,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:23,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:04:23,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:23,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:23,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:23,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration14_Loop [2018-11-10 07:04:23,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:23,119 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:23,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,148 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:23,148 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:23,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:23,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:23,166 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:23,166 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=3} Honda state: {ULTIMATE.start_main_~i~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:23,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:23,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:23,184 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:23,185 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:23,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:23,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:23,203 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:04:23,203 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:23,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:04:23,206 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a052f807-bdec-4b66-9e3e-44eec30a68c2/bin-2019/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 [2018-11-10 07:04:23,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:04:23,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:04:23,241 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:04:23,242 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:04:23,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:04:23,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:04:23,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:04:23,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:04:23,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:04:23,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:04:23,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:04:23,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration14_Loop [2018-11-10 07:04:23,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:04:23,243 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:04:23,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:04:23,272 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:04:23,272 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:04:23,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:23,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:23,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:23,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:23,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:23,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:23,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:23,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:04:23,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:04:23,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:04:23,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:04:23,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:04:23,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:04:23,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:04:23,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:04:23,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:04:23,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:04:23,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:04:23,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:04:23,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:04:23,286 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:04:23,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:04:23,286 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:04:23,286 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:04:23,286 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2018-11-10 07:04:23,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:04:23,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:23,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:04:23,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-10 07:04:23,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 149 states and 166 transitions. Complement of second has 5 states. [2018-11-10 07:04:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:04:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:04:23,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-10 07:04:23,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,311 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:04:23,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:23,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:04:23,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-10 07:04:23,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 149 states and 166 transitions. Complement of second has 5 states. [2018-11-10 07:04:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:04:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 07:04:23,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-10 07:04:23,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,330 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:04:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:04:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:04:23,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:04:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:04:23,342 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 07:04:23,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-10 07:04:23,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 163 states and 181 transitions. Complement of second has 4 states. [2018-11-10 07:04:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:04:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 07:04:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-10 07:04:23,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-10 07:04:23,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-10 07:04:23,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-10 07:04:23,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:04:23,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 181 transitions. [2018-11-10 07:04:23,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:04:23,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:04:23,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:04:23,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:04:23,354 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 07:04:23,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:04:23,354 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:04:23,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:04:23,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:04:23 BoogieIcfgContainer [2018-11-10 07:04:23,358 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:04:23,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:04:23,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:04:23,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:04:23,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:04:20" (3/4) ... [2018-11-10 07:04:23,361 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:04:23,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:04:23,362 INFO L168 Benchmark]: Toolchain (without parser) took 3249.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 959.8 MB in the beginning and 988.9 MB in the end (delta: -29.0 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:04:23,363 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:04:23,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:04:23,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.07 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:04:23,364 INFO L168 Benchmark]: Boogie Preprocessor took 10.95 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:04:23,364 INFO L168 Benchmark]: RCFGBuilder took 167.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:04:23,364 INFO L168 Benchmark]: BuchiAutomizer took 2914.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.2 GB in the beginning and 988.9 MB in the end (delta: 165.0 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:04:23,364 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 988.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:04:23,366 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.07 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.95 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 167.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2914.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.2 GB in the beginning and 988.9 MB in the end (delta: 165.0 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 988.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (10 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 5 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 19 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 19 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 15 iterations. TraceHistogramMax:11. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 54 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 106 states and ocurred in iteration 13. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 110/110 HoareTripleCheckerStatistics: 138 SDtfs, 88 SDslu, 240 SDs, 0 SdLazy, 338 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf98 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...