./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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 32bit --witnessprinter.graph.data.programhash c8989412e094655bcf4508d76eb9764ed06d0b34 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:51:50,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:51:50,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:51:50,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:51:50,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:51:50,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:51:50,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:51:50,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:51:50,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:51:50,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:51:50,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:51:50,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:51:50,068 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:51:50,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:51:50,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:51:50,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:51:50,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:51:50,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:51:50,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:51:50,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:51:50,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:51:50,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:51:50,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:51:50,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:51:50,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:51:50,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:51:50,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:51:50,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:51:50,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:51:50,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:51:50,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:51:50,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:51:50,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:51:50,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:51:50,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:51:50,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:51:50,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:51:50,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:51:50,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:51:50,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:51:50,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:51:50,103 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:51:50,103 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:51:50,103 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:51:50,103 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:51:50,103 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:51:50,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:51:50,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:51:50,105 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:51:50,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:51:50,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:51:50,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:51:50,109 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:51:50,109 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:51:50,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:51:50,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:51:50,110 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:51:50,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:51:50,111 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_77645cbd-76a6-493b-acb4-1add14781b82/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2018-11-18 14:51:50,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:51:50,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:51:50,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:51:50,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:51:50,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:51:50,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-18 14:51:50,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/data/288df43c0/6d8a02aa802042d19baf60bc497abf88/FLAGed329f985 [2018-11-18 14:51:50,562 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:51:50,563 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-18 14:51:50,571 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/data/288df43c0/6d8a02aa802042d19baf60bc497abf88/FLAGed329f985 [2018-11-18 14:51:50,583 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/data/288df43c0/6d8a02aa802042d19baf60bc497abf88 [2018-11-18 14:51:50,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:51:50,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:51:50,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:51:50,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:51:50,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:51:50,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e66ea76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50, skipping insertion in model container [2018-11-18 14:51:50,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:51:50,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:51:50,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:51:50,804 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:51:50,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:51:50,860 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:51:50,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50 WrapperNode [2018-11-18 14:51:50,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:51:50,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:51:50,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:51:50,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:51:50,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:51:50,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:51:50,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:51:50,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:51:50,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:50,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:51,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:51,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:51,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... [2018-11-18 14:51:51,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:51:51,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:51:51,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:51:51,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:51:51,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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-18 14:51:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:51:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:51:51,613 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:51:51,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:51:51 BoogieIcfgContainer [2018-11-18 14:51:51,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:51:51,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:51:51,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:51:51,616 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:51:51,617 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:51:51,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:51:50" (1/3) ... [2018-11-18 14:51:51,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17cde6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:51:51, skipping insertion in model container [2018-11-18 14:51:51,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:51:51,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:51:50" (2/3) ... [2018-11-18 14:51:51,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17cde6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:51:51, skipping insertion in model container [2018-11-18 14:51:51,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:51:51,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:51:51" (3/3) ... [2018-11-18 14:51:51,620 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy2_false-unreach-call_false-termination.cil.c [2018-11-18 14:51:51,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:51:51,668 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:51:51,668 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:51:51,668 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:51:51,668 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:51:51,668 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:51:51,668 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:51:51,668 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:51:51,668 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:51:51,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2018-11-18 14:51:51,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-18 14:51:51,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:51,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:51,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,706 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:51:51,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2018-11-18 14:51:51,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-18 14:51:51,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:51,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:51,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,716 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 79#L394true assume !(1 == ~c_req_up~0); 68#L394-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 66#L405-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 94#L410-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 119#L415-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 4#L420-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 29#L425-1true assume !(0 == ~e_f~0); 59#L430-1true assume !(0 == ~e_g~0); 85#L435-1true assume !(0 == ~e_e~0); 111#L440-1true assume !(0 == ~e_c~0); 134#L445-1true assume !(0 == ~e_wl~0); 22#L450-1true assume !(1 == ~wl_pc~0); 109#L462true assume !(2 == ~wl_pc~0); 72#L463true assume !(1 == ~c1_pc~0); 107#L473true assume !(1 == ~c2_pc~0); 75#L482true assume !(1 == ~wb_pc~0); 45#L491true assume !(1 == ~e_c~0); 132#L500-1true assume !(1 == ~e_e~0); 18#L505-1true assume !(1 == ~e_f~0); 50#L510-1true assume !(1 == ~e_g~0); 76#L515-1true assume !(1 == ~e_c~0); 103#L520-1true assume !(1 == ~e_wl~0); 25#L662-1true [2018-11-18 14:51:51,716 INFO L796 eck$LassoCheckResult]: Loop: 25#L662-1true assume true; 101#L531true assume !false; 48#L532true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 54#L367true assume !true; 80#L383true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 38#L538true assume !(1 == ~c_req_up~0); 19#L538-2true start_simulation_~kernel_st~0 := 3; 125#L550true assume 0 == ~e_f~0;~e_f~0 := 1; 105#L550-2true assume 0 == ~e_g~0;~e_g~0 := 1; 8#L555-1true assume 0 == ~e_e~0;~e_e~0 := 1; 39#L560-1true assume 0 == ~e_c~0;~e_c~0 := 1; 49#L565-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 73#L570-1true assume 1 == ~wl_pc~0; 64#L576true assume 1 == ~e_wl~0;~wl_st~0 := 0; 122#L583true assume !(1 == ~c1_pc~0); 35#L593true assume !(1 == ~c2_pc~0); 137#L602true assume !(1 == ~wb_pc~0); 96#L611true assume 1 == ~e_c~0;~r_st~0 := 0; 63#L620-1true assume 1 == ~e_e~0;~e_e~0 := 2; 91#L625-1true assume 1 == ~e_f~0;~e_f~0 := 2; 117#L630-1true assume 1 == ~e_g~0;~e_g~0 := 2; 138#L635-1true assume 1 == ~e_c~0;~e_c~0 := 2; 26#L640-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 43#L645-1true assume 0 == ~wl_st~0; 25#L662-1true [2018-11-18 14:51:51,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-18 14:51:51,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:51,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:51,832 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-18 14:51:51,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:51,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:51,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:51,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1385552249, now seen corresponding path program 1 times [2018-11-18 14:51:51,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:51,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:51,847 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-18 14:51:51,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:51,849 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:51,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:51:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:51:51,865 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 2 states. [2018-11-18 14:51:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:51,877 INFO L93 Difference]: Finished difference Result 135 states and 228 transitions. [2018-11-18 14:51:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:51:51,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 228 transitions. [2018-11-18 14:51:51,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:51,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 130 states and 223 transitions. [2018-11-18 14:51:51,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-18 14:51:51,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-18 14:51:51,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 223 transitions. [2018-11-18 14:51:51,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:51:51,892 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-18 14:51:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 223 transitions. [2018-11-18 14:51:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-18 14:51:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 14:51:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 223 transitions. [2018-11-18 14:51:51,917 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-18 14:51:51,917 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-18 14:51:51,918 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:51:51,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 223 transitions. [2018-11-18 14:51:51,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:51,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:51,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:51,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:51,920 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 299#L394 assume !(1 == ~c_req_up~0); 301#L394-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 383#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 384#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 399#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 283#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 284#L425-1 assume !(0 == ~e_f~0); 332#L430-1 assume !(0 == ~e_g~0); 376#L435-1 assume !(0 == ~e_e~0); 394#L440-1 assume !(0 == ~e_c~0); 405#L445-1 assume !(0 == ~e_wl~0); 322#L450-1 assume !(1 == ~wl_pc~0); 323#L462 assume !(2 == ~wl_pc~0); 308#L463 assume !(1 == ~c1_pc~0); 388#L473 assume !(1 == ~c2_pc~0); 313#L482 assume !(1 == ~wb_pc~0); 360#L491 assume !(1 == ~e_c~0); 361#L500-1 assume !(1 == ~e_e~0); 314#L505-1 assume !(1 == ~e_f~0); 315#L510-1 assume !(1 == ~e_g~0); 366#L515-1 assume !(1 == ~e_c~0); 390#L520-1 assume !(1 == ~e_wl~0); 326#L662-1 [2018-11-18 14:51:51,921 INFO L796 eck$LassoCheckResult]: Loop: 326#L662-1 assume true; 328#L531 assume !false; 363#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 364#L367 assume true; 371#L284-1 assume !false; 288#L285 assume !(0 == ~wl_st~0); 290#L289 assume !(0 == ~c1_st~0); 398#L292 assume !(0 == ~c2_st~0); 377#L295 assume !(0 == ~wb_st~0); 378#L298 assume !(0 == ~r_st~0); 385#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 350#L538 assume !(1 == ~c_req_up~0); 318#L538-2 start_simulation_~kernel_st~0 := 3; 319#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 403#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 294#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 295#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 353#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 365#L570-1 assume !(1 == ~wl_pc~0); 346#L582 assume !(2 == ~wl_pc~0); 348#L583 assume !(1 == ~c1_pc~0); 338#L593 assume !(1 == ~c2_pc~0); 339#L602 assume !(1 == ~wb_pc~0); 355#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 380#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 381#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 396#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 407#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 329#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 330#L645-1 assume 0 == ~wl_st~0; 326#L662-1 [2018-11-18 14:51:51,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-18 14:51:51,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:51,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:51,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:51,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:51,961 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-18 14:51:51,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:51,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:51,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:51,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 1 times [2018-11-18 14:51:51,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:51,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:51:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:51,997 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-18 14:51:51,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:51,998 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:51,998 INFO L87 Difference]: Start difference. First operand 130 states and 223 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-18 14:51:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:52,023 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2018-11-18 14:51:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:52,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 222 transitions. [2018-11-18 14:51:52,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 222 transitions. [2018-11-18 14:51:52,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-18 14:51:52,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-18 14:51:52,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 222 transitions. [2018-11-18 14:51:52,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:51:52,028 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-18 14:51:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 222 transitions. [2018-11-18 14:51:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-18 14:51:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 14:51:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 222 transitions. [2018-11-18 14:51:52,036 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-18 14:51:52,036 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-18 14:51:52,036 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:51:52,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 222 transitions. [2018-11-18 14:51:52,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:52,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:52,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,039 INFO L794 eck$LassoCheckResult]: Stem: 669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 566#L394 assume !(1 == ~c_req_up~0); 568#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 650#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 651#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 666#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 550#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 551#L425-1 assume !(0 == ~e_f~0); 599#L430-1 assume !(0 == ~e_g~0); 643#L435-1 assume !(0 == ~e_e~0); 661#L440-1 assume !(0 == ~e_c~0); 672#L445-1 assume !(0 == ~e_wl~0); 589#L450-1 assume !(1 == ~wl_pc~0); 590#L462 assume !(2 == ~wl_pc~0); 575#L463 assume !(1 == ~c1_pc~0); 655#L473 assume !(1 == ~c2_pc~0); 580#L482 assume !(1 == ~wb_pc~0); 627#L491 assume !(1 == ~e_c~0); 628#L500-1 assume !(1 == ~e_e~0); 581#L505-1 assume !(1 == ~e_f~0); 582#L510-1 assume !(1 == ~e_g~0); 633#L515-1 assume !(1 == ~e_c~0); 657#L520-1 assume !(1 == ~e_wl~0); 593#L662-1 [2018-11-18 14:51:52,039 INFO L796 eck$LassoCheckResult]: Loop: 593#L662-1 assume true; 595#L531 assume !false; 631#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 632#L367 assume true; 638#L284-1 assume !false; 555#L285 assume !(0 == ~wl_st~0); 557#L289 assume !(0 == ~c1_st~0); 665#L292 assume !(0 == ~c2_st~0); 644#L295 assume !(0 == ~wb_st~0); 645#L298 assume !(0 == ~r_st~0); 652#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 617#L538 assume !(1 == ~c_req_up~0); 585#L538-2 start_simulation_~kernel_st~0 := 3; 586#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 670#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 561#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 562#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 619#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 630#L570-1 assume !(1 == ~wl_pc~0); 613#L582 assume !(2 == ~wl_pc~0); 615#L583 assume !(1 == ~c1_pc~0); 607#L593 assume !(1 == ~c2_pc~0); 608#L602 assume !(1 == ~wb_pc~0); 622#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 647#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 648#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 663#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 674#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 596#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 597#L645-1 assume 0 == ~wl_st~0; 593#L662-1 [2018-11-18 14:51:52,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-18 14:51:52,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,076 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-18 14:51:52,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:52,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:52,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 2 times [2018-11-18 14:51:52,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,112 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-18 14:51:52,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:52,112 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:52,113 INFO L87 Difference]: Start difference. First operand 130 states and 222 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-18 14:51:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:52,141 INFO L93 Difference]: Finished difference Result 130 states and 221 transitions. [2018-11-18 14:51:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:52,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 221 transitions. [2018-11-18 14:51:52,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 221 transitions. [2018-11-18 14:51:52,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-18 14:51:52,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-18 14:51:52,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 221 transitions. [2018-11-18 14:51:52,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:51:52,149 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-18 14:51:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 221 transitions. [2018-11-18 14:51:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-18 14:51:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 14:51:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 221 transitions. [2018-11-18 14:51:52,155 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-18 14:51:52,155 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-18 14:51:52,155 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:51:52,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 221 transitions. [2018-11-18 14:51:52,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:52,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:52,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,160 INFO L794 eck$LassoCheckResult]: Stem: 936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 833#L394 assume !(1 == ~c_req_up~0); 835#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 917#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 918#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 933#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 817#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 818#L425-1 assume !(0 == ~e_f~0); 866#L430-1 assume !(0 == ~e_g~0); 910#L435-1 assume !(0 == ~e_e~0); 929#L440-1 assume !(0 == ~e_c~0); 939#L445-1 assume !(0 == ~e_wl~0); 856#L450-1 assume !(1 == ~wl_pc~0); 857#L462 assume !(2 == ~wl_pc~0); 842#L463 assume !(1 == ~c1_pc~0); 922#L473 assume !(1 == ~c2_pc~0); 847#L482 assume !(1 == ~wb_pc~0); 894#L491 assume !(1 == ~e_c~0); 895#L500-1 assume !(1 == ~e_e~0); 848#L505-1 assume !(1 == ~e_f~0); 849#L510-1 assume !(1 == ~e_g~0); 900#L515-1 assume !(1 == ~e_c~0); 924#L520-1 assume !(1 == ~e_wl~0); 860#L662-1 [2018-11-18 14:51:52,160 INFO L796 eck$LassoCheckResult]: Loop: 860#L662-1 assume true; 862#L531 assume !false; 898#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 899#L367 assume true; 905#L284-1 assume !false; 822#L285 assume !(0 == ~wl_st~0); 824#L289 assume !(0 == ~c1_st~0); 932#L292 assume !(0 == ~c2_st~0); 911#L295 assume !(0 == ~wb_st~0); 912#L298 assume !(0 == ~r_st~0); 919#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 884#L538 assume !(1 == ~c_req_up~0); 852#L538-2 start_simulation_~kernel_st~0 := 3; 853#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 937#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 828#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 829#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 887#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 897#L570-1 assume !(1 == ~wl_pc~0); 880#L582 assume !(2 == ~wl_pc~0); 882#L583 assume !(1 == ~c1_pc~0); 874#L593 assume !(1 == ~c2_pc~0); 875#L602 assume !(1 == ~wb_pc~0); 889#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 914#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 915#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 931#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 941#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 863#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 864#L645-1 assume 0 == ~wl_st~0; 860#L662-1 [2018-11-18 14:51:52,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-18 14:51:52,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:51:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,182 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-18 14:51:52,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:52,183 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:52,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 3 times [2018-11-18 14:51:52,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,223 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-18 14:51:52,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:52,223 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:52,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:52,224 INFO L87 Difference]: Start difference. First operand 130 states and 221 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-18 14:51:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:52,232 INFO L93 Difference]: Finished difference Result 130 states and 220 transitions. [2018-11-18 14:51:52,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:52,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 220 transitions. [2018-11-18 14:51:52,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 220 transitions. [2018-11-18 14:51:52,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-18 14:51:52,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-18 14:51:52,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 220 transitions. [2018-11-18 14:51:52,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:51:52,237 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-18 14:51:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 220 transitions. [2018-11-18 14:51:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-18 14:51:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 14:51:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 220 transitions. [2018-11-18 14:51:52,241 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-18 14:51:52,241 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-18 14:51:52,241 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:51:52,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 220 transitions. [2018-11-18 14:51:52,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-18 14:51:52,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:52,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:52,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,243 INFO L794 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1099#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1100#L394 assume !(1 == ~c_req_up~0); 1102#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1184#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1185#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1200#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1084#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1085#L425-1 assume !(0 == ~e_f~0); 1133#L430-1 assume !(0 == ~e_g~0); 1177#L435-1 assume !(0 == ~e_e~0); 1196#L440-1 assume !(0 == ~e_c~0); 1206#L445-1 assume !(0 == ~e_wl~0); 1123#L450-1 assume !(1 == ~wl_pc~0); 1124#L462 assume !(2 == ~wl_pc~0); 1109#L463 assume !(1 == ~c1_pc~0); 1189#L473 assume !(1 == ~c2_pc~0); 1114#L482 assume !(1 == ~wb_pc~0); 1161#L491 assume !(1 == ~e_c~0); 1162#L500-1 assume !(1 == ~e_e~0); 1117#L505-1 assume !(1 == ~e_f~0); 1118#L510-1 assume !(1 == ~e_g~0); 1167#L515-1 assume !(1 == ~e_c~0); 1191#L520-1 assume !(1 == ~e_wl~0); 1127#L662-1 [2018-11-18 14:51:52,243 INFO L796 eck$LassoCheckResult]: Loop: 1127#L662-1 assume true; 1129#L531 assume !false; 1165#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1166#L367 assume true; 1172#L284-1 assume !false; 1089#L285 assume !(0 == ~wl_st~0); 1091#L289 assume !(0 == ~c1_st~0); 1199#L292 assume !(0 == ~c2_st~0); 1178#L295 assume !(0 == ~wb_st~0); 1179#L298 assume !(0 == ~r_st~0); 1186#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1151#L538 assume !(1 == ~c_req_up~0); 1115#L538-2 start_simulation_~kernel_st~0 := 3; 1116#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 1204#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1095#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1096#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1154#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1164#L570-1 assume !(1 == ~wl_pc~0); 1147#L582 assume !(2 == ~wl_pc~0); 1149#L583 assume !(1 == ~c1_pc~0); 1141#L593 assume !(1 == ~c2_pc~0); 1142#L602 assume !(1 == ~wb_pc~0); 1156#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1181#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1182#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1198#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1208#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1130#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1131#L645-1 assume 0 == ~wl_st~0; 1127#L662-1 [2018-11-18 14:51:52,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-18 14:51:52,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:51:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 4 times [2018-11-18 14:51:52,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,327 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-18 14:51:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:52,328 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:52,328 INFO L87 Difference]: Start difference. First operand 130 states and 220 transitions. cyclomatic complexity: 91 Second operand 3 states. [2018-11-18 14:51:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:52,470 INFO L93 Difference]: Finished difference Result 191 states and 317 transitions. [2018-11-18 14:51:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:52,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 317 transitions. [2018-11-18 14:51:52,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 160 [2018-11-18 14:51:52,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 191 states and 317 transitions. [2018-11-18 14:51:52,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-11-18 14:51:52,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-18 14:51:52,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 317 transitions. [2018-11-18 14:51:52,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:51:52,473 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-18 14:51:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 317 transitions. [2018-11-18 14:51:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-18 14:51:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-18 14:51:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 317 transitions. [2018-11-18 14:51:52,479 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-18 14:51:52,479 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-18 14:51:52,479 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:51:52,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 317 transitions. [2018-11-18 14:51:52,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 160 [2018-11-18 14:51:52,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:52,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:52,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:52,483 INFO L794 eck$LassoCheckResult]: Stem: 1533#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1426#L394 assume !(1 == ~c_req_up~0); 1428#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1512#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1513#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1528#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1411#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1412#L425-1 assume !(0 == ~e_f~0); 1461#L430-1 assume !(0 == ~e_g~0); 1504#L435-1 assume !(0 == ~e_e~0); 1524#L440-1 assume !(0 == ~e_c~0); 1537#L445-1 assume !(0 == ~e_wl~0); 1449#L450-1 assume !(1 == ~wl_pc~0); 1450#L462 assume !(2 == ~wl_pc~0); 1438#L463 assume !(1 == ~c1_pc~0); 1517#L473 assume !(1 == ~c2_pc~0); 1440#L482 assume !(1 == ~wb_pc~0); 1488#L491 assume !(1 == ~e_c~0); 1489#L500-1 assume !(1 == ~e_e~0); 1443#L505-1 assume !(1 == ~e_f~0); 1444#L510-1 assume !(1 == ~e_g~0); 1494#L515-1 assume !(1 == ~e_c~0); 1519#L520-1 assume !(1 == ~e_wl~0); 1534#L662-1 [2018-11-18 14:51:52,484 INFO L796 eck$LassoCheckResult]: Loop: 1534#L662-1 assume true; 1556#L531 assume !false; 1551#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1547#L367 assume true; 1546#L284-1 assume !false; 1545#L285 assume !(0 == ~wl_st~0); 1417#L289 assume !(0 == ~c1_st~0); 1527#L292 assume !(0 == ~c2_st~0); 1505#L295 assume !(0 == ~wb_st~0); 1506#L298 assume !(0 == ~r_st~0); 1514#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1477#L538 assume !(1 == ~c_req_up~0); 1441#L538-2 start_simulation_~kernel_st~0 := 3; 1442#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 1535#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1421#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1422#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1481#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1491#L570-1 assume 1 == ~wl_pc~0; 1510#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1511#L583 assume !(1 == ~c1_pc~0); 1582#L593 assume !(1 == ~c2_pc~0); 1575#L602 assume !(1 == ~wb_pc~0); 1574#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1573#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1572#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1571#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1566#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1564#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1562#L645-1 assume 0 == ~wl_st~0; 1534#L662-1 [2018-11-18 14:51:52,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2018-11-18 14:51:52,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:51:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 866284251, now seen corresponding path program 1 times [2018-11-18 14:51:52,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:51:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:52,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -861392463, now seen corresponding path program 1 times [2018-11-18 14:51:52,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:52,607 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-18 14:51:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:52,825 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-18 14:51:52,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:52,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:52,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:52,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:52,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:51:52,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:52,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:52,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:52,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-18 14:51:52,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:52,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:52,871 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-18 14:51:52,890 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-18 14:51:52,895 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-18 14:51:52,898 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-18 14:51:52,901 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-18 14:51:52,905 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-18 14:51:52,926 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-18 14:51:52,942 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-18 14:51:52,945 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-18 14:51:52,947 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-18 14:51:52,948 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-18 14:51:52,952 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-18 14:51:52,958 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-18 14:51:52,966 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-18 14:51:52,968 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-18 14:51:52,973 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-18 14:51:52,975 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-18 14:51:52,978 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-18 14:51:52,980 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-18 14:51:52,981 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-18 14:51:52,984 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-18 14:51:52,986 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-18 14:51:52,988 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-18 14:51:52,989 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-18 14:51:52,993 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-18 14:51:52,994 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-18 14:51:53,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:53,215 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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-18 14:51:53,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:53,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:53,224 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:51:53,224 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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-18 14:51:53,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:53,244 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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-18 14:51:53,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:51:53,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:53,265 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:51:53,279 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:53,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:53,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:53,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:53,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:51:53,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:53,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:53,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:53,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-18 14:51:53,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:53,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:53,282 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-18 14:51:53,285 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-18 14:51:53,289 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-18 14:51:53,294 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-18 14:51:53,296 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-18 14:51:53,299 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-18 14:51:53,303 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-18 14:51:53,305 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-18 14:51:53,307 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-18 14:51:53,308 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-18 14:51:53,310 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-18 14:51:53,314 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-18 14:51:53,316 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-18 14:51:53,318 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-18 14:51:53,320 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-18 14:51:53,323 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-18 14:51:53,325 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-18 14:51:53,329 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-18 14:51:53,332 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-18 14:51:53,334 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-18 14:51:53,338 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-18 14:51:53,341 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-18 14:51:53,343 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-18 14:51:53,372 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-18 14:51:53,390 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-18 14:51:53,392 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-18 14:51:53,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:53,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:51:53,614 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-18 14:51:53,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:53,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:53,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:53,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:51:53,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:53,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:51:53,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:53,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:51:53,623 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-18 14:51:53,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:53,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:53,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:53,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:53,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:53,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:53,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:53,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:51:53,632 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:51:53,632 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:51:53,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:51:53,634 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:51:53,634 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:51:53,634 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-18 14:51:53,635 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:51:53,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:53,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:53,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:53,873 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-18 14:51:53,876 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-18 14:51:53,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 317 transitions. cyclomatic complexity: 127 Second operand 5 states. [2018-11-18 14:51:53,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 317 transitions. cyclomatic complexity: 127. Second operand 5 states. Result 679 states and 1116 transitions. Complement of second has 5 states. [2018-11-18 14:51:53,969 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-18 14:51:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:51:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2018-11-18 14:51:53,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 24 letters. Loop has 30 letters. [2018-11-18 14:51:53,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:53,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 54 letters. Loop has 30 letters. [2018-11-18 14:51:53,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:53,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 24 letters. Loop has 60 letters. [2018-11-18 14:51:53,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:53,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 1116 transitions. [2018-11-18 14:51:53,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2018-11-18 14:51:53,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 679 states and 1116 transitions. [2018-11-18 14:51:53,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2018-11-18 14:51:53,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 516 [2018-11-18 14:51:53,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 1116 transitions. [2018-11-18 14:51:53,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:53,984 INFO L705 BuchiCegarLoop]: Abstraction has 679 states and 1116 transitions. [2018-11-18 14:51:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 1116 transitions. [2018-11-18 14:51:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 515. [2018-11-18 14:51:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-18 14:51:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 849 transitions. [2018-11-18 14:51:54,001 INFO L728 BuchiCegarLoop]: Abstraction has 515 states and 849 transitions. [2018-11-18 14:51:54,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:54,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:54,001 INFO L87 Difference]: Start difference. First operand 515 states and 849 transitions. Second operand 3 states. [2018-11-18 14:51:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:54,070 INFO L93 Difference]: Finished difference Result 515 states and 840 transitions. [2018-11-18 14:51:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:54,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 840 transitions. [2018-11-18 14:51:54,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 320 [2018-11-18 14:51:54,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 515 states and 840 transitions. [2018-11-18 14:51:54,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2018-11-18 14:51:54,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2018-11-18 14:51:54,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 840 transitions. [2018-11-18 14:51:54,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:54,076 INFO L705 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-18 14:51:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 840 transitions. [2018-11-18 14:51:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-11-18 14:51:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-18 14:51:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 840 transitions. [2018-11-18 14:51:54,086 INFO L728 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-18 14:51:54,086 INFO L608 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-18 14:51:54,086 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:51:54,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 840 transitions. [2018-11-18 14:51:54,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 320 [2018-11-18 14:51:54,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:54,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:54,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:54,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:54,090 INFO L794 eck$LassoCheckResult]: Stem: 3727#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3525#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3526#L394 assume !(1 == ~c_req_up~0); 3528#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3684#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3685#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3713#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3499#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3500#L425-1 assume !(0 == ~e_f~0); 3585#L430-1 assume !(0 == ~e_g~0); 3668#L435-1 assume !(0 == ~e_e~0); 3706#L440-1 assume !(0 == ~e_c~0); 3737#L445-1 assume !(0 == ~e_wl~0); 3563#L450-1 assume !(1 == ~wl_pc~0); 3564#L462 assume !(2 == ~wl_pc~0); 3546#L463 assume !(1 == ~c1_pc~0); 3691#L473 assume !(1 == ~c2_pc~0); 3548#L482 assume !(1 == ~wb_pc~0); 3637#L491 assume !(1 == ~e_c~0); 3638#L500-1 assume !(1 == ~e_e~0); 3553#L505-1 assume !(1 == ~e_f~0); 3554#L510-1 assume !(1 == ~e_g~0); 3647#L515-1 assume !(1 == ~e_c~0); 3693#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3571#L662-1 [2018-11-18 14:51:54,090 INFO L796 eck$LassoCheckResult]: Loop: 3571#L662-1 assume true; 3572#L531 assume !false; 3957#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3953#L367 assume true; 3952#L284-1 assume !false; 3951#L285 assume 0 == ~wl_st~0; 3950#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 3948#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 3947#L56 assume 0 == ~wl_pc~0; 3934#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 3933#L117 assume { :end_inline_write_loop } true; 3932#L307 assume !(0 == ~c1_st~0); 3919#L322 assume !(0 == ~c2_st~0); 3916#L337 assume !(0 == ~wb_st~0); 3738#L352 assume !(0 == ~r_st~0); 3644#L367 assume true; 3656#L284-1 assume !false; 3507#L285 assume !(0 == ~wl_st~0); 3508#L289 assume !(0 == ~c1_st~0); 3711#L292 assume !(0 == ~c2_st~0); 3669#L295 assume !(0 == ~wb_st~0); 3671#L298 assume !(0 == ~r_st~0); 3686#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 3695#L538 assume !(1 == ~c_req_up~0); 3813#L538-2 start_simulation_~kernel_st~0 := 3; 3812#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 3811#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3517#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3518#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3810#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3867#L570-1 assume 1 == ~wl_pc~0; 3865#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3862#L583 assume !(1 == ~c1_pc~0); 3860#L593 assume !(1 == ~c2_pc~0); 3855#L602 assume !(1 == ~wb_pc~0); 3853#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 3851#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3849#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3847#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3844#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3575#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3576#L645-1 assume 0 == ~wl_st~0; 3571#L662-1 [2018-11-18 14:51:54,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2018-11-18 14:51:54,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:54,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:54,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:54,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:54,115 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-18 14:51:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:54,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:51:54,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:54,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1878871200, now seen corresponding path program 1 times [2018-11-18 14:51:54,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:54,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:54,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:54,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:54,294 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-18 14:51:54,337 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:54,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:54,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:54,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:54,338 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:51:54,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:54,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:54,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:54,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-18 14:51:54,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:54,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:54,340 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-18 14:51:54,369 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-18 14:51:54,370 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-18 14:51:54,373 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-18 14:51:54,375 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-18 14:51:54,377 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-18 14:51:54,381 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-18 14:51:54,382 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-18 14:51:54,385 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-18 14:51:54,386 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-18 14:51:54,389 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-18 14:51:54,391 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-18 14:51:54,397 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-18 14:51:54,398 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-18 14:51:54,402 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-18 14:51:54,407 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-18 14:51:54,409 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-18 14:51:54,410 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-18 14:51:54,412 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-18 14:51:54,414 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-18 14:51:54,416 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-18 14:51:54,417 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-18 14:51:54,420 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-18 14:51:54,421 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-18 14:51:54,422 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-18 14:51:54,424 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-18 14:51:54,425 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-18 14:51:54,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:54,577 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/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-18 14:51:54,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:54,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:54,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:51:54,587 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:54,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:54,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:54,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:51:54,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:54,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:54,639 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:54,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:51:54,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:54,668 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:51:54,690 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:54,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:54,690 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:54,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:54,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:51:54,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:54,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:54,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:54,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-18 14:51:54,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:54,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:54,692 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-18 14:51:54,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-18 14:51:54,695 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-18 14:51:54,700 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-18 14:51:54,700 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-18 14:51:54,703 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-18 14:51:54,705 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-18 14:51:54,708 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-18 14:51:54,714 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-18 14:51:54,738 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-18 14:51:54,742 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-18 14:51:54,754 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-18 14:51:54,758 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-18 14:51:54,759 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-18 14:51:54,762 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-18 14:51:54,765 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-18 14:51:54,767 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-18 14:51:54,769 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-18 14:51:54,770 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-18 14:51:54,771 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-18 14:51:54,773 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-18 14:51:54,773 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-18 14:51:54,776 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-18 14:51:54,777 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-18 14:51:54,778 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-18 14:51:54,780 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-18 14:51:54,781 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-18 14:51:54,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:54,950 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:51:54,950 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-18 14:51:54,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:54,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:54,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:54,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:54,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:54,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:54,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:54,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:51:54,952 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-18 14:51:54,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:54,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:54,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:54,953 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:51:54,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:54,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:51:54,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:54,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:51:54,954 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-18 14:51:54,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:54,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:54,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:54,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:54,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:54,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:54,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:54,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:51:54,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:51:54,959 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:51:54,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:51:54,959 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:51:54,959 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:51:54,959 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2018-11-18 14:51:54,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:51:54,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:54,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:55,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:51:55,065 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-18 14:51:55,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 840 transitions. cyclomatic complexity: 328 Second operand 5 states. [2018-11-18 14:51:55,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 840 transitions. cyclomatic complexity: 328. Second operand 5 states. Result 999 states and 1618 transitions. Complement of second has 7 states. [2018-11-18 14:51:55,155 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-18 14:51:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:51:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2018-11-18 14:51:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 24 letters. Loop has 42 letters. [2018-11-18 14:51:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 66 letters. Loop has 42 letters. [2018-11-18 14:51:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 24 letters. Loop has 84 letters. [2018-11-18 14:51:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:55,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 999 states and 1618 transitions. [2018-11-18 14:51:55,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 609 [2018-11-18 14:51:55,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 999 states to 985 states and 1599 transitions. [2018-11-18 14:51:55,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2018-11-18 14:51:55,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2018-11-18 14:51:55,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 985 states and 1599 transitions. [2018-11-18 14:51:55,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:55,167 INFO L705 BuchiCegarLoop]: Abstraction has 985 states and 1599 transitions. [2018-11-18 14:51:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states and 1599 transitions. [2018-11-18 14:51:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 810. [2018-11-18 14:51:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2018-11-18 14:51:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1319 transitions. [2018-11-18 14:51:55,181 INFO L728 BuchiCegarLoop]: Abstraction has 810 states and 1319 transitions. [2018-11-18 14:51:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:55,181 INFO L87 Difference]: Start difference. First operand 810 states and 1319 transitions. Second operand 3 states. [2018-11-18 14:51:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:55,392 INFO L93 Difference]: Finished difference Result 998 states and 1595 transitions. [2018-11-18 14:51:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:55,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 998 states and 1595 transitions. [2018-11-18 14:51:55,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 640 [2018-11-18 14:51:55,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 998 states to 998 states and 1595 transitions. [2018-11-18 14:51:55,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2018-11-18 14:51:55,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 672 [2018-11-18 14:51:55,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 998 states and 1595 transitions. [2018-11-18 14:51:55,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:55,405 INFO L705 BuchiCegarLoop]: Abstraction has 998 states and 1595 transitions. [2018-11-18 14:51:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states and 1595 transitions. [2018-11-18 14:51:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 995. [2018-11-18 14:51:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-11-18 14:51:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1592 transitions. [2018-11-18 14:51:55,419 INFO L728 BuchiCegarLoop]: Abstraction has 995 states and 1592 transitions. [2018-11-18 14:51:55,419 INFO L608 BuchiCegarLoop]: Abstraction has 995 states and 1592 transitions. [2018-11-18 14:51:55,419 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:51:55,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 995 states and 1592 transitions. [2018-11-18 14:51:55,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 638 [2018-11-18 14:51:55,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:55,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:55,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:55,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:55,424 INFO L794 eck$LassoCheckResult]: Stem: 7276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7068#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 7069#L394 assume !(1 == ~c_req_up~0); 7071#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7236#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7237#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7268#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7044#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7045#L425-1 assume !(0 == ~e_f~0); 7130#L430-1 assume !(0 == ~e_g~0); 7220#L435-1 assume !(0 == ~e_e~0); 7261#L440-1 assume !(0 == ~e_c~0); 7289#L445-1 assume !(0 == ~e_wl~0); 7106#L450-1 assume !(1 == ~wl_pc~0); 7107#L462 assume !(2 == ~wl_pc~0); 7089#L463 assume !(1 == ~c1_pc~0); 7244#L473 assume !(1 == ~c2_pc~0); 7091#L482 assume !(1 == ~wb_pc~0); 7186#L491 assume !(1 == ~e_c~0); 7187#L500-1 assume !(1 == ~e_e~0); 7100#L505-1 assume !(1 == ~e_f~0); 7101#L510-1 assume !(1 == ~e_g~0); 7197#L515-1 assume !(1 == ~e_c~0); 7248#L520-1 assume !(1 == ~e_wl~0); 7281#L662-1 assume true; 7517#L531 [2018-11-18 14:51:55,424 INFO L796 eck$LassoCheckResult]: Loop: 7517#L531 assume !false; 7935#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7931#L367 assume true; 7929#L284-1 assume !false; 7928#L285 assume 0 == ~wl_st~0; 7923#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 7920#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 7198#L56 assume 0 == ~wl_pc~0; 7055#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 7245#L117 assume { :end_inline_write_loop } true; 7767#L307 assume !(0 == ~c1_st~0); 7762#L322 assume !(0 == ~c2_st~0); 7759#L337 assume !(0 == ~wb_st~0); 7622#L352 assume !(0 == ~r_st~0); 7620#L367 assume true; 7608#L284-1 assume !false; 7607#L285 assume !(0 == ~wl_st~0); 7604#L289 assume !(0 == ~c1_st~0); 7606#L292 assume !(0 == ~c2_st~0); 7660#L295 assume !(0 == ~wb_st~0); 7657#L298 assume !(0 == ~r_st~0); 7654#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 7651#L538 assume !(1 == ~c_req_up~0); 7092#L538-2 start_simulation_~kernel_st~0 := 3; 7093#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 7283#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7284#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7514#L560-1 assume !(0 == ~e_c~0); 7557#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7554#L570-1 assume 1 == ~wl_pc~0; 7555#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 7550#L583 assume !(1 == ~c1_pc~0); 7963#L593 assume !(1 == ~c2_pc~0); 7959#L602 assume !(1 == ~wb_pc~0); 7956#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 7955#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7952#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7950#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7948#L635-1 assume !(1 == ~e_c~0); 7942#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7941#L645-1 assume 0 == ~wl_st~0; 7939#L662-1 assume true; 7517#L531 [2018-11-18 14:51:55,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 1 times [2018-11-18 14:51:55,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:55,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:55,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:55,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:55,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1824537726, now seen corresponding path program 1 times [2018-11-18 14:51:55,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:55,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 14:51:55,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:55,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:55,506 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:51:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:55,507 INFO L87 Difference]: Start difference. First operand 995 states and 1592 transitions. cyclomatic complexity: 600 Second operand 3 states. [2018-11-18 14:51:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:55,667 INFO L93 Difference]: Finished difference Result 1169 states and 1904 transitions. [2018-11-18 14:51:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:55,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1169 states and 1904 transitions. [2018-11-18 14:51:55,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 692 [2018-11-18 14:51:55,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1169 states to 1117 states and 1806 transitions. [2018-11-18 14:51:55,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 740 [2018-11-18 14:51:55,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 740 [2018-11-18 14:51:55,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1117 states and 1806 transitions. [2018-11-18 14:51:55,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:55,683 INFO L705 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-18 14:51:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states and 1806 transitions. [2018-11-18 14:51:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2018-11-18 14:51:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-18 14:51:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1806 transitions. [2018-11-18 14:51:55,699 INFO L728 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-18 14:51:55,699 INFO L608 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-18 14:51:55,699 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:51:55,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1806 transitions. [2018-11-18 14:51:55,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 692 [2018-11-18 14:51:55,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:55,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:55,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:55,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:55,711 INFO L794 eck$LassoCheckResult]: Stem: 9449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9240#L394 assume !(1 == ~c_req_up~0); 9242#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9407#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9408#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9440#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9214#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9215#L425-1 assume !(0 == ~e_f~0); 9300#L430-1 assume !(0 == ~e_g~0); 9389#L435-1 assume !(0 == ~e_e~0); 9433#L440-1 assume 0 == ~e_c~0;~e_c~0 := 1; 9461#L445-1 assume !(0 == ~e_wl~0); 9278#L450-1 assume !(1 == ~wl_pc~0); 9279#L462 assume !(2 == ~wl_pc~0); 9261#L463 assume !(1 == ~c1_pc~0); 9418#L473 assume !(1 == ~c2_pc~0); 9263#L482 assume !(1 == ~wb_pc~0); 9356#L491 assume 1 == ~e_c~0;~r_st~0 := 0; 9357#L500-1 assume !(1 == ~e_e~0); 9272#L505-1 assume !(1 == ~e_f~0); 9273#L510-1 assume !(1 == ~e_g~0); 9367#L515-1 assume 1 == ~e_c~0;~e_c~0 := 2; 9422#L520-1 assume !(1 == ~e_wl~0); 9454#L662-1 assume true; 9620#L531 [2018-11-18 14:51:55,712 INFO L796 eck$LassoCheckResult]: Loop: 9620#L531 assume !false; 10019#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 9836#L367 assume true; 9837#L284-1 assume !false; 9221#L285 assume 0 == ~wl_st~0; 9222#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 9759#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 10015#L56 assume 0 == ~wl_pc~0; 9226#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 9419#L117 assume { :end_inline_write_loop } true; 10227#L307 assume !(0 == ~c1_st~0); 10224#L322 assume !(0 == ~c2_st~0); 10220#L337 assume !(0 == ~wb_st~0); 10212#L352 assume !(0 == ~r_st~0); 9947#L367 assume true; 9948#L284-1 assume !false; 9943#L285 assume !(0 == ~wl_st~0); 9944#L289 assume !(0 == ~c1_st~0); 10235#L292 assume !(0 == ~c2_st~0); 10232#L295 assume !(0 == ~wb_st~0); 10233#L298 assume !(0 == ~r_st~0); 10234#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 10290#L538 assume !(1 == ~c_req_up~0); 10288#L538-2 start_simulation_~kernel_st~0 := 3; 10287#L550 assume 0 == ~e_f~0;~e_f~0 := 1; 10285#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10282#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9339#L560-1 assume !(0 == ~e_c~0); 9340#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9926#L570-1 assume 1 == ~wl_pc~0; 10056#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 10054#L583 assume !(1 == ~c1_pc~0); 10052#L593 assume !(1 == ~c2_pc~0); 10049#L602 assume !(1 == ~wb_pc~0); 10048#L611 assume !(1 == ~e_c~0); 10047#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10046#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 10045#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10040#L635-1 assume !(1 == ~e_c~0); 10037#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10006#L645-1 assume 0 == ~wl_st~0; 10028#L662-1 assume true; 9620#L531 [2018-11-18 14:51:55,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1430069003, now seen corresponding path program 1 times [2018-11-18 14:51:55,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:55,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:55,855 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-18 14:51:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:51:55,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:55,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1661082944, now seen corresponding path program 1 times [2018-11-18 14:51:55,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:55,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:55,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:55,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:56,079 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-11-18 14:51:56,118 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:56,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:56,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:56,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:56,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:51:56,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:56,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:56,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:56,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-18 14:51:56,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:56,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:56,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-18 14:51:56,128 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-18 14:51:56,130 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-18 14:51:56,144 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-18 14:51:56,176 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-18 14:51:56,178 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-18 14:51:56,182 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-18 14:51:56,184 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-18 14:51:56,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:51:56,188 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-18 14:51:56,190 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-18 14:51:56,192 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-18 14:51:56,196 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-18 14:51:56,198 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-18 14:51:56,200 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-18 14:51:56,204 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-18 14:51:56,207 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-18 14:51:56,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:51:56,212 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-18 14:51:56,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:51:56,216 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-18 14:51:56,234 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-18 14:51:56,262 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-18 14:51:56,278 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-18 14:51:56,281 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-18 14:51:56,282 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-18 14:51:56,291 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-18 14:51:56,435 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-18 14:51:56,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:56,593 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:56,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:56,596 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:56,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:51:56,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:56,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:51:56,641 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:56,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:56,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:56,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:56,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:51:56,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:56,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:56,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:56,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-18 14:51:56,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:56,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:56,643 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-18 14:51:56,647 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-18 14:51:56,650 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-18 14:51:56,651 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-18 14:51:56,654 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-18 14:51:56,655 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-18 14:51:56,658 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-18 14:51:56,659 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-18 14:51:56,661 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-18 14:51:56,662 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-18 14:51:56,663 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-18 14:51:56,665 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-18 14:51:56,667 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-18 14:51:56,668 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-18 14:51:56,672 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-18 14:51:56,674 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-18 14:51:56,678 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-18 14:51:56,684 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-18 14:51:56,686 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-18 14:51:56,691 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-18 14:51:56,692 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-18 14:51:56,693 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-18 14:51:56,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-18 14:51:56,699 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-18 14:51:56,700 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-18 14:51:56,701 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-18 14:51:56,702 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-18 14:51:56,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:56,827 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:51:56,827 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-18 14:51:56,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:56,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:56,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:56,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:56,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:56,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:56,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:56,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:51:56,829 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-18 14:51:56,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:56,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:56,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:56,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:56,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:56,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:56,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:56,831 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:51:56,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:51:56,832 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:51:56,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:51:56,833 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:51:56,833 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:51:56,833 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2018-11-18 14:51:56,833 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:51:56,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:56,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:56,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 14:51:56,908 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-18 14:51:56,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1117 states and 1806 transitions. cyclomatic complexity: 692 Second operand 5 states. [2018-11-18 14:51:56,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1117 states and 1806 transitions. cyclomatic complexity: 692. Second operand 5 states. Result 3238 states and 5243 transitions. Complement of second has 5 states. [2018-11-18 14:51:56,998 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-18 14:51:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:51:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-18 14:51:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 42 letters. [2018-11-18 14:51:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 67 letters. Loop has 42 letters. [2018-11-18 14:51:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 84 letters. [2018-11-18 14:51:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:57,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3238 states and 5243 transitions. [2018-11-18 14:51:57,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1342 [2018-11-18 14:51:57,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3238 states to 3208 states and 5207 transitions. [2018-11-18 14:51:57,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1415 [2018-11-18 14:51:57,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1432 [2018-11-18 14:51:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3208 states and 5207 transitions. [2018-11-18 14:51:57,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:57,048 INFO L705 BuchiCegarLoop]: Abstraction has 3208 states and 5207 transitions. [2018-11-18 14:51:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states and 5207 transitions. [2018-11-18 14:51:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3152. [2018-11-18 14:51:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2018-11-18 14:51:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 5140 transitions. [2018-11-18 14:51:57,094 INFO L728 BuchiCegarLoop]: Abstraction has 3152 states and 5140 transitions. [2018-11-18 14:51:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:51:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:51:57,094 INFO L87 Difference]: Start difference. First operand 3152 states and 5140 transitions. Second operand 4 states. [2018-11-18 14:51:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:57,963 INFO L93 Difference]: Finished difference Result 4348 states and 6974 transitions. [2018-11-18 14:51:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:51:57,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4348 states and 6974 transitions. [2018-11-18 14:51:57,988 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1664 [2018-11-18 14:51:58,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4348 states to 4348 states and 6974 transitions. [2018-11-18 14:51:58,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1760 [2018-11-18 14:51:58,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1760 [2018-11-18 14:51:58,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4348 states and 6974 transitions. [2018-11-18 14:51:58,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:58,009 INFO L705 BuchiCegarLoop]: Abstraction has 4348 states and 6974 transitions. [2018-11-18 14:51:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states and 6974 transitions. [2018-11-18 14:51:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3696. [2018-11-18 14:51:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2018-11-18 14:51:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5961 transitions. [2018-11-18 14:51:58,065 INFO L728 BuchiCegarLoop]: Abstraction has 3696 states and 5961 transitions. [2018-11-18 14:51:58,065 INFO L608 BuchiCegarLoop]: Abstraction has 3696 states and 5961 transitions. [2018-11-18 14:51:58,065 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 14:51:58,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3696 states and 5961 transitions. [2018-11-18 14:51:58,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1366 [2018-11-18 14:51:58,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:58,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:58,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:58,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:58,079 INFO L794 eck$LassoCheckResult]: Stem: 21543#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 21317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 21318#L394 assume !(1 == ~c_req_up~0); 21320#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 21491#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 21492#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 21569#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 21570#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 21378#L425-1 assume !(0 == ~e_f~0); 21379#L430-1 assume !(0 == ~e_g~0); 21469#L435-1 assume !(0 == ~e_e~0); 21560#L440-1 assume !(0 == ~e_c~0); 21561#L445-1 assume !(0 == ~e_wl~0); 21356#L450-1 assume !(1 == ~wl_pc~0); 21357#L462 assume !(2 == ~wl_pc~0); 21503#L463 assume !(1 == ~c1_pc~0); 21502#L473 assume !(1 == ~c2_pc~0); 21504#L482 assume !(1 == ~wb_pc~0); 21505#L491 assume 1 == ~e_c~0;~r_st~0 := 0; 21438#L500-1 assume !(1 == ~e_e~0); 21343#L505-1 assume !(1 == ~e_f~0); 21344#L510-1 assume !(1 == ~e_g~0); 21449#L515-1 assume 1 == ~e_c~0;~e_c~0 := 2; 21507#L520-1 assume !(1 == ~e_wl~0); 21827#L662-1 assume true; 21828#L531 assume !false; 23597#L532 [2018-11-18 14:51:58,080 INFO L796 eck$LassoCheckResult]: Loop: 23597#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 21458#L367 assume true; 21459#L284-1 assume !false; 21300#L285 assume 0 == ~wl_st~0; 21301#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 21539#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 21450#L56 assume 0 == ~wl_pc~0; 21305#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 21372#L117 assume { :end_inline_write_loop } true; 21373#L307 assume !(0 == ~c1_st~0); 24734#L322 assume !(0 == ~c2_st~0); 24726#L337 assume !(0 == ~wb_st~0); 24718#L352 assume !(0 == ~r_st~0); 21443#L367 assume true; 23736#L284-1 assume !false; 24616#L285 assume !(0 == ~wl_st~0); 24615#L289 assume !(0 == ~c1_st~0); 24614#L292 assume !(0 == ~c2_st~0); 24612#L295 assume !(0 == ~wb_st~0); 24609#L298 assume !(0 == ~r_st~0); 24606#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 24252#L538 assume !(1 == ~c_req_up~0); 24253#L538-2 start_simulation_~kernel_st~0 := 3; 24772#L550 assume !(0 == ~e_f~0); 24771#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 24770#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 24769#L560-1 assume !(0 == ~e_c~0); 24768#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 24767#L570-1 assume 1 == ~wl_pc~0; 24765#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 24762#L583 assume !(1 == ~c1_pc~0); 24760#L593 assume !(1 == ~c2_pc~0); 24736#L602 assume !(1 == ~wb_pc~0); 24727#L611 assume !(1 == ~e_c~0); 24719#L620-1 assume 1 == ~e_e~0;~e_e~0 := 2; 24712#L625-1 assume !(1 == ~e_f~0); 24619#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 24618#L635-1 assume !(1 == ~e_c~0); 24613#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 21369#L645-1 assume 0 == ~wl_st~0; 21431#L662-1 assume true; 24983#L531 assume !false; 23597#L532 [2018-11-18 14:51:58,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1632637665, now seen corresponding path program 1 times [2018-11-18 14:51:58,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:58,176 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-18 14:51:58,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:58,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:51:58,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:58,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -222958810, now seen corresponding path program 1 times [2018-11-18 14:51:58,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:58,384 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-18 14:51:58,443 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:58,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:58,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:58,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:58,443 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:51:58,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:58,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:58,444 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:58,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 14:51:58,444 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:58,444 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:58,445 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-18 14:51:58,450 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-18 14:51:58,453 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-18 14:51:58,454 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-18 14:51:58,456 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-18 14:51:58,457 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-18 14:51:58,458 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-18 14:51:58,459 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-18 14:51:58,460 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-18 14:51:58,462 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-18 14:51:58,467 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-18 14:51:58,469 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-18 14:51:58,470 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-18 14:51:58,471 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-18 14:51:58,473 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-18 14:51:58,474 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-18 14:51:58,477 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-18 14:51:58,478 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-18 14:51:58,480 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-18 14:51:58,483 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-18 14:51:58,485 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-18 14:51:58,488 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-18 14:51:58,489 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-18 14:51:58,494 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-18 14:51:58,497 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-18 14:51:58,498 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-18 14:51:58,501 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-18 14:51:58,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:58,649 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:58,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:58,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:58,659 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:51:58,659 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:58,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:51:58,679 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:58,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:51:58,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:51:58,705 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:51:58,719 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:51:58,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:51:58,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:51:58,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:51:58,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:51:58,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:51:58,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:51:58,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:51:58,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 14:51:58,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:51:58,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:51:58,722 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-18 14:51:58,726 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-18 14:51:58,729 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-18 14:51:58,730 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-18 14:51:58,731 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-18 14:51:58,735 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-18 14:51:58,746 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-18 14:51:58,747 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-18 14:51:58,749 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-18 14:51:58,750 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-18 14:51:58,751 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-18 14:51:58,754 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-18 14:51:58,755 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-18 14:51:58,759 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-18 14:51:58,768 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-18 14:51:58,769 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-18 14:51:58,771 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-18 14:51:58,775 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-18 14:51:58,776 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-18 14:51:58,778 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-18 14:51:58,780 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-18 14:51:58,781 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-18 14:51:58,783 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-18 14:51:58,785 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-18 14:51:58,789 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-18 14:51:58,790 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-18 14:51:58,793 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-18 14:51:58,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:51:58,936 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:51:58,936 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-18 14:51:58,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:58,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:58,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:58,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:51:58,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:58,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:51:58,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:58,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:51:58,938 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-18 14:51:58,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:51:58,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:51:58,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:51:58,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:51:58,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:51:58,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:51:58,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:51:58,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:51:58,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:51:58,942 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:51:58,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:51:58,942 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:51:58,943 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:51:58,943 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2018-11-18 14:51:58,943 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:51:58,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:58,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:59,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:51:59,056 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-18 14:51:59,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3696 states and 5961 transitions. cyclomatic complexity: 2276 Second operand 5 states. [2018-11-18 14:51:59,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3696 states and 5961 transitions. cyclomatic complexity: 2276. Second operand 5 states. Result 9679 states and 15608 transitions. Complement of second has 7 states. [2018-11-18 14:51:59,194 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-18 14:51:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:51:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-18 14:51:59,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 26 letters. Loop has 42 letters. [2018-11-18 14:51:59,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:59,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 68 letters. Loop has 42 letters. [2018-11-18 14:51:59,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:59,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 26 letters. Loop has 84 letters. [2018-11-18 14:51:59,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:51:59,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9679 states and 15608 transitions. [2018-11-18 14:51:59,222 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1926 [2018-11-18 14:51:59,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9679 states to 9575 states and 15468 transitions. [2018-11-18 14:51:59,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2179 [2018-11-18 14:51:59,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2182 [2018-11-18 14:51:59,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9575 states and 15468 transitions. [2018-11-18 14:51:59,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:59,261 INFO L705 BuchiCegarLoop]: Abstraction has 9575 states and 15468 transitions. [2018-11-18 14:51:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states and 15468 transitions. [2018-11-18 14:51:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 9477. [2018-11-18 14:51:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9477 states. [2018-11-18 14:51:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9477 states to 9477 states and 15330 transitions. [2018-11-18 14:51:59,371 INFO L728 BuchiCegarLoop]: Abstraction has 9477 states and 15330 transitions. [2018-11-18 14:51:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:51:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:51:59,372 INFO L87 Difference]: Start difference. First operand 9477 states and 15330 transitions. Second operand 3 states. [2018-11-18 14:51:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:59,521 INFO L93 Difference]: Finished difference Result 10395 states and 16719 transitions. [2018-11-18 14:51:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:51:59,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10395 states and 16719 transitions. [2018-11-18 14:51:59,541 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2131 [2018-11-18 14:51:59,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10395 states to 10395 states and 16719 transitions. [2018-11-18 14:51:59,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2345 [2018-11-18 14:51:59,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2345 [2018-11-18 14:51:59,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10395 states and 16719 transitions. [2018-11-18 14:51:59,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:59,573 INFO L705 BuchiCegarLoop]: Abstraction has 10395 states and 16719 transitions. [2018-11-18 14:51:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states and 16719 transitions. [2018-11-18 14:51:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 9691. [2018-11-18 14:51:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2018-11-18 14:51:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 15658 transitions. [2018-11-18 14:51:59,673 INFO L728 BuchiCegarLoop]: Abstraction has 9691 states and 15658 transitions. [2018-11-18 14:51:59,673 INFO L608 BuchiCegarLoop]: Abstraction has 9691 states and 15658 transitions. [2018-11-18 14:51:59,673 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 14:51:59,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9691 states and 15658 transitions. [2018-11-18 14:51:59,693 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1926 [2018-11-18 14:51:59,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:51:59,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:51:59,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:59,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:59,695 INFO L794 eck$LassoCheckResult]: Stem: 55012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 54794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 54795#L394 assume !(1 == ~c_req_up~0); 54797#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 54962#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 54963#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55034#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55035#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 54859#L425-1 assume !(0 == ~e_f~0); 54860#L430-1 assume !(0 == ~e_g~0); 54946#L435-1 assume !(0 == ~e_e~0); 55024#L440-1 assume !(0 == ~e_c~0); 55025#L445-1 assume !(0 == ~e_wl~0); 55081#L450-1 assume !(1 == ~wl_pc~0); 55077#L462 assume !(2 == ~wl_pc~0); 55074#L463 assume !(1 == ~c1_pc~0); 55071#L473 assume !(1 == ~c2_pc~0); 55067#L482 assume !(1 == ~wb_pc~0); 54913#L491 assume !(1 == ~e_c~0); 54914#L500-1 assume !(1 == ~e_e~0); 54826#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 54827#L510-1 assume !(1 == ~e_g~0); 54979#L515-1 assume !(1 == ~e_c~0); 54980#L520-1 assume !(1 == ~e_wl~0); 55015#L662-1 assume true; 58190#L531 assume !false; 58184#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 55103#L367 [2018-11-18 14:51:59,696 INFO L796 eck$LassoCheckResult]: Loop: 55103#L367 assume true; 55102#L284-1 assume !false; 55101#L285 assume 0 == ~wl_st~0; 55100#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 55005#L311 assume !(0 != eval_~tmp~0); 55006#L307 assume !(0 == ~c1_st~0); 55117#L322 assume !(0 == ~c2_st~0); 55112#L337 assume !(0 == ~wb_st~0); 55106#L352 assume !(0 == ~r_st~0); 55103#L367 [2018-11-18 14:51:59,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2020941705, now seen corresponding path program 1 times [2018-11-18 14:51:59,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:59,746 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-18 14:51:59,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:59,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:51:59,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:51:59,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1559341301, now seen corresponding path program 1 times [2018-11-18 14:51:59,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:51:59,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:51:59,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:59,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:51:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:51:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:51:59,786 INFO L87 Difference]: Start difference. First operand 9691 states and 15658 transitions. cyclomatic complexity: 6022 Second operand 4 states. [2018-11-18 14:51:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:59,913 INFO L93 Difference]: Finished difference Result 13170 states and 21040 transitions. [2018-11-18 14:51:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:51:59,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13170 states and 21040 transitions. [2018-11-18 14:51:59,947 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 2650 [2018-11-18 14:51:59,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13170 states to 12290 states and 19706 transitions. [2018-11-18 14:51:59,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3229 [2018-11-18 14:51:59,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3229 [2018-11-18 14:51:59,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12290 states and 19706 transitions. [2018-11-18 14:51:59,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:51:59,981 INFO L705 BuchiCegarLoop]: Abstraction has 12290 states and 19706 transitions. [2018-11-18 14:51:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states and 19706 transitions. [2018-11-18 14:52:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11110. [2018-11-18 14:52:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11110 states. [2018-11-18 14:52:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 17882 transitions. [2018-11-18 14:52:00,090 INFO L728 BuchiCegarLoop]: Abstraction has 11110 states and 17882 transitions. [2018-11-18 14:52:00,090 INFO L608 BuchiCegarLoop]: Abstraction has 11110 states and 17882 transitions. [2018-11-18 14:52:00,090 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 14:52:00,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11110 states and 17882 transitions. [2018-11-18 14:52:00,160 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2090 [2018-11-18 14:52:00,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:52:00,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:52:00,161 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:00,161 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:00,161 INFO L794 eck$LassoCheckResult]: Stem: 77895#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 77667#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 77668#L394 assume !(1 == ~c_req_up~0); 77859#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 77842#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 77843#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 78001#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 78000#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 77732#L425-1 assume !(0 == ~e_f~0); 77733#L430-1 assume !(0 == ~e_g~0); 77871#L435-1 assume !(0 == ~e_e~0); 77872#L440-1 assume !(0 == ~e_c~0); 77910#L445-1 assume !(0 == ~e_wl~0); 77981#L450-1 assume !(1 == ~wl_pc~0); 77974#L462 assume !(2 == ~wl_pc~0); 77969#L463 assume !(1 == ~c1_pc~0); 77963#L473 assume !(1 == ~c2_pc~0); 77957#L482 assume !(1 == ~wb_pc~0); 77951#L491 assume !(1 == ~e_c~0); 77948#L500-1 assume !(1 == ~e_e~0); 77945#L505-1 assume !(1 == ~e_f~0); 77942#L510-1 assume !(1 == ~e_g~0); 77856#L515-1 assume !(1 == ~e_c~0); 77857#L520-1 assume !(1 == ~e_wl~0); 79164#L662-1 assume true; 79157#L531 assume !false; 79159#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 78018#L367 [2018-11-18 14:52:00,161 INFO L796 eck$LassoCheckResult]: Loop: 78018#L367 assume true; 78071#L284-1 assume !false; 78070#L285 assume 0 == ~wl_st~0; 78069#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 78067#L311 assume !(0 != eval_~tmp~0); 78066#L307 assume !(0 == ~c1_st~0); 78033#L322 assume !(0 == ~c2_st~0); 78031#L337 assume !(0 == ~wb_st~0); 78016#L352 assume !(0 == ~r_st~0); 78018#L367 [2018-11-18 14:52:00,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 1 times [2018-11-18 14:52:00,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1559341301, now seen corresponding path program 2 times [2018-11-18 14:52:00,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:00,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1765976301, now seen corresponding path program 1 times [2018-11-18 14:52:00,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:52:00,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:00,226 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-18 14:52:00,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:52:00,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:52:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:52:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:00,252 INFO L87 Difference]: Start difference. First operand 11110 states and 17882 transitions. cyclomatic complexity: 6827 Second operand 3 states. [2018-11-18 14:52:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:00,296 INFO L93 Difference]: Finished difference Result 17836 states and 28360 transitions. [2018-11-18 14:52:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:52:00,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17836 states and 28360 transitions. [2018-11-18 14:52:00,333 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3248 [2018-11-18 14:52:00,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17836 states to 17836 states and 28360 transitions. [2018-11-18 14:52:00,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3974 [2018-11-18 14:52:00,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3974 [2018-11-18 14:52:00,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17836 states and 28360 transitions. [2018-11-18 14:52:00,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:52:00,381 INFO L705 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-18 14:52:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17836 states and 28360 transitions. [2018-11-18 14:52:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17836 to 17836. [2018-11-18 14:52:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17836 states. [2018-11-18 14:52:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17836 states to 17836 states and 28360 transitions. [2018-11-18 14:52:00,529 INFO L728 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-18 14:52:00,529 INFO L608 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-18 14:52:00,529 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 14:52:00,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17836 states and 28360 transitions. [2018-11-18 14:52:00,552 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3248 [2018-11-18 14:52:00,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:52:00,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:52:00,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:00,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:00,553 INFO L794 eck$LassoCheckResult]: Stem: 106856#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 106621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 106622#L394 assume !(1 == ~c_req_up~0); 106818#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 106949#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 106840#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 106841#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 106595#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 106596#L425-1 assume !(0 == ~e_f~0); 106684#L430-1 assume !(0 == ~e_g~0); 106830#L435-1 assume !(0 == ~e_e~0); 106831#L440-1 assume !(0 == ~e_c~0); 106870#L445-1 assume !(0 == ~e_wl~0); 106937#L450-1 assume !(1 == ~wl_pc~0); 106930#L462 assume !(2 == ~wl_pc~0); 106925#L463 assume !(1 == ~c1_pc~0); 106919#L473 assume !(1 == ~c2_pc~0); 106913#L482 assume !(1 == ~wb_pc~0); 106907#L491 assume !(1 == ~e_c~0); 106903#L500-1 assume !(1 == ~e_e~0); 106900#L505-1 assume !(1 == ~e_f~0); 106897#L510-1 assume !(1 == ~e_g~0); 106815#L515-1 assume !(1 == ~e_c~0); 106816#L520-1 assume !(1 == ~e_wl~0); 106860#L662-1 assume true; 108697#L531 assume !false; 108232#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 107021#L367 [2018-11-18 14:52:00,553 INFO L796 eck$LassoCheckResult]: Loop: 107021#L367 assume true; 107123#L284-1 assume !false; 107122#L285 assume 0 == ~wl_st~0; 107011#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 107012#L311 assume !(0 != eval_~tmp~0); 107109#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 107106#L326 assume !(0 != eval_~tmp___0~0); 107089#L322 assume !(0 == ~c2_st~0); 106981#L337 assume !(0 == ~wb_st~0); 106978#L352 assume !(0 == ~r_st~0); 107021#L367 [2018-11-18 14:52:00,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 2 times [2018-11-18 14:52:00,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1147620883, now seen corresponding path program 1 times [2018-11-18 14:52:00,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:52:00,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:00,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1036628709, now seen corresponding path program 1 times [2018-11-18 14:52:00,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:00,655 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-18 14:52:00,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:52:00,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:52:00,871 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 14:52:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:52:00,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:00,908 INFO L87 Difference]: Start difference. First operand 17836 states and 28360 transitions. cyclomatic complexity: 10579 Second operand 3 states. [2018-11-18 14:52:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:00,979 INFO L93 Difference]: Finished difference Result 28806 states and 45105 transitions. [2018-11-18 14:52:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:52:00,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28806 states and 45105 transitions. [2018-11-18 14:52:01,061 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-18 14:52:01,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28806 states to 28806 states and 45105 transitions. [2018-11-18 14:52:01,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6508 [2018-11-18 14:52:01,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6508 [2018-11-18 14:52:01,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28806 states and 45105 transitions. [2018-11-18 14:52:01,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:52:01,146 INFO L705 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-18 14:52:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28806 states and 45105 transitions. [2018-11-18 14:52:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28806 to 28806. [2018-11-18 14:52:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28806 states. [2018-11-18 14:52:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28806 states to 28806 states and 45105 transitions. [2018-11-18 14:52:01,448 INFO L728 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-18 14:52:01,448 INFO L608 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-18 14:52:01,448 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 14:52:01,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28806 states and 45105 transitions. [2018-11-18 14:52:01,492 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-18 14:52:01,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:52:01,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:52:01,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:01,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:01,493 INFO L794 eck$LassoCheckResult]: Stem: 153506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 153271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 153272#L394 assume !(1 == ~c_req_up~0); 153455#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 153456#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 153492#L410-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 153493#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 153245#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 153246#L425-1 assume !(0 == ~e_f~0); 153596#L430-1 assume !(0 == ~e_g~0); 153595#L435-1 assume !(0 == ~e_e~0); 153593#L440-1 assume !(0 == ~e_c~0); 153594#L445-1 assume !(0 == ~e_wl~0); 153590#L450-1 assume !(1 == ~wl_pc~0); 153586#L462 assume !(2 == ~wl_pc~0); 153587#L463 assume !(1 == ~c1_pc~0); 153582#L473 assume !(1 == ~c2_pc~0); 153581#L482 assume !(1 == ~wb_pc~0); 160074#L491 assume !(1 == ~e_c~0); 153570#L500-1 assume !(1 == ~e_e~0); 153571#L505-1 assume !(1 == ~e_f~0); 153561#L510-1 assume !(1 == ~e_g~0); 153562#L515-1 assume !(1 == ~e_c~0); 160072#L520-1 assume !(1 == ~e_wl~0); 160069#L662-1 assume true; 160070#L531 assume !false; 162588#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 156169#L367 [2018-11-18 14:52:01,493 INFO L796 eck$LassoCheckResult]: Loop: 156169#L367 assume true; 156167#L284-1 assume !false; 156165#L285 assume 0 == ~wl_st~0; 156163#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 156161#L311 assume !(0 != eval_~tmp~0); 156160#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 156142#L326 assume !(0 != eval_~tmp___0~0); 156159#L322 assume !(0 == ~c2_st~0); 156185#L337 assume !(0 == ~wb_st~0); 156174#L352 assume !(0 == ~r_st~0); 156169#L367 [2018-11-18 14:52:01,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash -27079625, now seen corresponding path program 1 times [2018-11-18 14:52:01,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:01,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:01,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:01,518 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-18 14:52:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:52:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:52:01,519 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:52:01,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1147620883, now seen corresponding path program 2 times [2018-11-18 14:52:01,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:01,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:52:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:01,556 INFO L87 Difference]: Start difference. First operand 28806 states and 45105 transitions. cyclomatic complexity: 16354 Second operand 3 states. [2018-11-18 14:52:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:01,600 INFO L93 Difference]: Finished difference Result 28701 states and 44924 transitions. [2018-11-18 14:52:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:52:01,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28701 states and 44924 transitions. [2018-11-18 14:52:01,653 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-18 14:52:01,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28701 states to 28701 states and 44924 transitions. [2018-11-18 14:52:01,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6410 [2018-11-18 14:52:01,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6410 [2018-11-18 14:52:01,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28701 states and 44924 transitions. [2018-11-18 14:52:01,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:52:01,698 INFO L705 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-18 14:52:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28701 states and 44924 transitions. [2018-11-18 14:52:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28701 to 28701. [2018-11-18 14:52:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28701 states. [2018-11-18 14:52:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28701 states to 28701 states and 44924 transitions. [2018-11-18 14:52:02,128 INFO L728 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-18 14:52:02,128 INFO L608 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-18 14:52:02,128 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 14:52:02,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28701 states and 44924 transitions. [2018-11-18 14:52:02,162 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-18 14:52:02,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:52:02,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:52:02,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:02,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:02,163 INFO L794 eck$LassoCheckResult]: Stem: 211022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 210785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 210786#L394 assume !(1 == ~c_req_up~0); 210979#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 211125#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 211006#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 211007#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 210758#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 210759#L425-1 assume !(0 == ~e_f~0); 210848#L430-1 assume !(0 == ~e_g~0); 210993#L435-1 assume !(0 == ~e_e~0); 210994#L440-1 assume !(0 == ~e_c~0); 211036#L445-1 assume !(0 == ~e_wl~0); 211113#L450-1 assume !(1 == ~wl_pc~0); 211106#L462 assume !(2 == ~wl_pc~0); 211101#L463 assume !(1 == ~c1_pc~0); 211095#L473 assume !(1 == ~c2_pc~0); 211089#L482 assume !(1 == ~wb_pc~0); 211083#L491 assume !(1 == ~e_c~0); 211079#L500-1 assume !(1 == ~e_e~0); 211076#L505-1 assume !(1 == ~e_f~0); 211073#L510-1 assume !(1 == ~e_g~0); 210977#L515-1 assume !(1 == ~e_c~0); 210978#L520-1 assume !(1 == ~e_wl~0); 215151#L662-1 assume true; 215152#L531 assume !false; 223705#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 223706#L367 [2018-11-18 14:52:02,163 INFO L796 eck$LassoCheckResult]: Loop: 223706#L367 assume true; 225877#L284-1 assume !false; 225874#L285 assume 0 == ~wl_st~0; 225872#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 211014#L311 assume !(0 != eval_~tmp~0); 211015#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 216655#L326 assume !(0 != eval_~tmp___0~0); 216654#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 216615#L341 assume !(0 != eval_~tmp___1~0); 216651#L337 assume !(0 == ~wb_st~0); 225881#L352 assume !(0 == ~r_st~0); 223706#L367 [2018-11-18 14:52:02,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 3 times [2018-11-18 14:52:02,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:02,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:02,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:52:02,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:02,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1218190504, now seen corresponding path program 1 times [2018-11-18 14:52:02,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:52:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:02,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2069037408, now seen corresponding path program 1 times [2018-11-18 14:52:02,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:02,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:02,228 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-18 14:52:02,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:52:02,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:52:02,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:52:02,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:02,254 INFO L87 Difference]: Start difference. First operand 28701 states and 44924 transitions. cyclomatic complexity: 16278 Second operand 3 states. [2018-11-18 14:52:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:02,340 INFO L93 Difference]: Finished difference Result 49147 states and 75976 transitions. [2018-11-18 14:52:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:52:02,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49147 states and 75976 transitions. [2018-11-18 14:52:02,441 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 8802 [2018-11-18 14:52:02,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49147 states to 49147 states and 75976 transitions. [2018-11-18 14:52:02,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10850 [2018-11-18 14:52:02,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10850 [2018-11-18 14:52:02,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49147 states and 75976 transitions. [2018-11-18 14:52:02,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:52:02,521 INFO L705 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-18 14:52:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49147 states and 75976 transitions. [2018-11-18 14:52:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49147 to 49147. [2018-11-18 14:52:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49147 states. [2018-11-18 14:52:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49147 states to 49147 states and 75976 transitions. [2018-11-18 14:52:03,032 INFO L728 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-18 14:52:03,032 INFO L608 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-18 14:52:03,032 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 14:52:03,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49147 states and 75976 transitions. [2018-11-18 14:52:03,094 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 8802 [2018-11-18 14:52:03,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:52:03,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:52:03,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:03,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:03,095 INFO L794 eck$LassoCheckResult]: Stem: 288886#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 288641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 288642#L394 assume !(1 == ~c_req_up~0); 288846#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 288991#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 288869#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 288870#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 288614#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 288615#L425-1 assume !(0 == ~e_f~0); 288707#L430-1 assume !(0 == ~e_g~0); 288857#L435-1 assume !(0 == ~e_e~0); 288858#L440-1 assume !(0 == ~e_c~0); 288903#L445-1 assume !(0 == ~e_wl~0); 288979#L450-1 assume !(1 == ~wl_pc~0); 288972#L462 assume !(2 == ~wl_pc~0); 288967#L463 assume !(1 == ~c1_pc~0); 288961#L473 assume !(1 == ~c2_pc~0); 288955#L482 assume !(1 == ~wb_pc~0); 288949#L491 assume !(1 == ~e_c~0); 288945#L500-1 assume !(1 == ~e_e~0); 288942#L505-1 assume !(1 == ~e_f~0); 288939#L510-1 assume !(1 == ~e_g~0); 288844#L515-1 assume !(1 == ~e_c~0); 288845#L520-1 assume !(1 == ~e_wl~0); 296136#L662-1 assume true; 296137#L531 assume !false; 311960#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 297835#L367 [2018-11-18 14:52:03,095 INFO L796 eck$LassoCheckResult]: Loop: 297835#L367 assume true; 297832#L284-1 assume !false; 297830#L285 assume 0 == ~wl_st~0; 297828#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 297824#L311 assume !(0 != eval_~tmp~0); 297825#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 302771#L326 assume !(0 != eval_~tmp___0~0); 302769#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 302745#L341 assume !(0 != eval_~tmp___1~0); 301233#L337 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 300844#L356 assume !(0 != eval_~tmp___2~0); 297839#L352 assume !(0 == ~r_st~0); 297835#L367 [2018-11-18 14:52:03,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 4 times [2018-11-18 14:52:03,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:03,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:03,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash 890763680, now seen corresponding path program 1 times [2018-11-18 14:52:03,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:52:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash -284386152, now seen corresponding path program 1 times [2018-11-18 14:52:03,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:52:03,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:52:03,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:03,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:52:03,489 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-11-18 14:52:03,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:52:03 BoogieIcfgContainer [2018-11-18 14:52:03,556 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:52:03,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:52:03,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:52:03,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:52:03,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:51:51" (3/4) ... [2018-11-18 14:52:03,559 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 14:52:03,611 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77645cbd-76a6-493b-acb4-1add14781b82/bin-2019/uautomizer/witness.graphml [2018-11-18 14:52:03,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:52:03,612 INFO L168 Benchmark]: Toolchain (without parser) took 13024.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.2 MB). Free memory was 954.4 MB in the beginning and 841.5 MB in the end (delta: 113.0 MB). Peak memory consumption was 602.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,613 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:52:03,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.00 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 935.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -228.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,613 INFO L168 Benchmark]: Boogie Preprocessor took 37.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,614 INFO L168 Benchmark]: RCFGBuilder took 597.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,614 INFO L168 Benchmark]: BuchiAutomizer took 11941.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 260.3 MB). Peak memory consumption was 585.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,614 INFO L168 Benchmark]: Witness Printer took 55.61 ms. Allocated memory is still 1.5 GB. Free memory was 851.7 MB in the beginning and 841.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:52:03,615 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.00 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 935.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -228.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 597.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11941.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 260.3 MB). Peak memory consumption was 585.4 MB. Max. memory is 11.5 GB. * Witness Printer took 55.61 ms. Allocated memory is still 1.5 GB. Free memory was 851.7 MB in the beginning and 841.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. 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 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 49147 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 1.7s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 14. Automata minimization 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 3032 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 49147 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/9 HoareTripleCheckerStatistics: 4878 SDtfs, 4064 SDslu, 3020 SDs, 0 SdLazy, 411 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN2 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf97 smp100 dnf180 smp68 tf111 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@712c7387=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2460af4d=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70eb7533=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5150a293=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bb46a42=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 284]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L700] CALL start_simulation() [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) [L455] COND FALSE !((int )wl_pc == 1) [L463] COND FALSE !((int )wl_pc == 2) [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) [L531] COND TRUE 1 [L534] kernel_st = 1 [L535] CALL eval() [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; Loop: [L284] COND TRUE 1 [L286] COND TRUE (int )wl_st == 0 [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND FALSE !(\read(tmp)) [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND FALSE !(\read(tmp___0)) [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND FALSE !(\read(tmp___2)) [L367] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...