./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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 a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-1dbac8b [2018-11-10 03:47:17,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:47:17,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:47:17,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:47:17,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:47:17,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:47:17,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:47:17,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:47:17,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:47:17,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:47:17,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:47:17,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:47:17,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:47:17,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:47:17,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:47:17,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:47:17,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:47:17,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:47:17,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:47:17,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:47:17,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:47:17,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:47:17,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:47:17,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:47:17,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:47:17,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:47:17,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:47:17,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:47:17,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:47:17,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:47:17,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:47:17,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:47:17,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:47:17,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:47:17,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:47:17,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:47:17,530 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:47:17,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:47:17,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:47:17,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:47:17,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:47:17,540 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:47:17,540 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:47:17,541 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:47:17,541 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:47:17,541 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:47:17,541 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:47:17,541 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:47:17,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:47:17,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:47:17,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:47:17,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:47:17,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:47:17,543 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:47:17,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:47:17,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:47:17,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:47:17,545 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:47:17,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:47:17,546 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:47:17,546 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:47:17,547 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:47:17,547 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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 -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2018-11-10 03:47:17,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:47:17,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:47:17,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:47:17,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:47:17,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:47:17,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:17,623 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/data/6877b1c03/137a3d65f466467e8bd45b0bfd781e24/FLAGceab38ae3 [2018-11-10 03:47:18,026 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:47:18,026 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:18,031 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/data/6877b1c03/137a3d65f466467e8bd45b0bfd781e24/FLAGceab38ae3 [2018-11-10 03:47:18,043 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/data/6877b1c03/137a3d65f466467e8bd45b0bfd781e24 [2018-11-10 03:47:18,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:47:18,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:47:18,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:18,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:47:18,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:47:18,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64edc3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18, skipping insertion in model container [2018-11-10 03:47:18,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:47:18,081 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:47:18,217 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:18,221 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:47:18,247 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:18,257 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:47:18,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18 WrapperNode [2018-11-10 03:47:18,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:18,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:47:18,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:47:18,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:47:18,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:47:18,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:47:18,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:47:18,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:47:18,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... [2018-11-10 03:47:18,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:47:18,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:47:18,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:47:18,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:47:18,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:47:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:47:18,788 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:47:18,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:18 BoogieIcfgContainer [2018-11-10 03:47:18,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:47:18,789 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:47:18,789 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:47:18,792 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:47:18,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:18,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:47:18" (1/3) ... [2018-11-10 03:47:18,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279d831f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:47:18, skipping insertion in model container [2018-11-10 03:47:18,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:18,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:18" (2/3) ... [2018-11-10 03:47:18,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279d831f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:47:18, skipping insertion in model container [2018-11-10 03:47:18,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:18,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:18" (3/3) ... [2018-11-10 03:47:18,796 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:18,842 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:47:18,843 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:47:18,843 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:47:18,843 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:47:18,843 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:47:18,843 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:47:18,844 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:47:18,844 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:47:18,844 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:47:18,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states. [2018-11-10 03:47:18,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2018-11-10 03:47:18,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:18,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:18,892 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-10 03:47:18,892 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-10 03:47:18,892 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:47:18,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states. [2018-11-10 03:47:18,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2018-11-10 03:47:18,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:18,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:18,898 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-10 03:47:18,898 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-10 03:47:18,905 INFO L793 eck$LassoCheckResult]: Stem: 95#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; 14#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; 4#L398true assume !(~c_req_up~0 == 1); 8#L398-2true assume !(~wl_i~0 == 1);~wl_st~0 := 2; 7#L409-1true assume !(~c1_i~0 == 1);~c1_st~0 := 2; 33#L414-1true assume ~c2_i~0 == 1;~c2_st~0 := 0; 59#L419-1true assume !(~wb_i~0 == 1);~wb_st~0 := 2; 81#L424-1true assume !(~r_i~0 == 1);~r_st~0 := 2; 110#L429-1true assume !(~e_f~0 == 0); 133#L434-1true assume !(~e_g~0 == 0); 30#L439-1true assume !(~e_e~0 == 0); 55#L444-1true assume !(~e_c~0 == 0); 78#L449-1true assume !(~e_wl~0 == 0); 103#L454-1true assume !(~wl_pc~0 == 1); 54#L466true assume !(~wl_pc~0 == 2); 131#L467true assume !(~c1_pc~0 == 1); 52#L477true assume !(~c2_pc~0 == 1); 20#L486true assume !(~wb_pc~0 == 1); 121#L495true assume !(~e_c~0 == 1); 75#L504-1true assume !(~e_e~0 == 1); 100#L509-1true assume !(~e_f~0 == 1); 127#L514-1true assume !(~e_g~0 == 1); 21#L519-1true assume !(~e_c~0 == 1); 46#L524-1true assume !(~e_wl~0 == 1); 86#L666-1true [2018-11-10 03:47:18,906 INFO L795 eck$LassoCheckResult]: Loop: 86#L666-1true assume true; 43#L535true assume !false; 124#L536true 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; 117#L371true assume !true; 6#L387true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 94#L542true assume !(~c_req_up~0 == 1); 101#L542-2true start_simulation_~kernel_st~0 := 3; 65#L554true assume !(~e_f~0 == 0); 51#L554-2true assume ~e_g~0 == 0;~e_g~0 := 1; 74#L559-1true assume ~e_e~0 == 0;~e_e~0 := 1; 96#L564-1true assume ~e_c~0 == 0;~e_c~0 := 1; 125#L569-1true assume ~e_wl~0 == 0;~e_wl~0 := 1; 19#L574-1true assume !(~wl_pc~0 == 1); 115#L586true assume !(~wl_pc~0 == 2); 63#L587true assume !(~c1_pc~0 == 1); 113#L597true assume !(~c2_pc~0 == 1); 68#L606true assume !(~wb_pc~0 == 1); 35#L615true assume ~e_c~0 == 1;~r_st~0 := 0; 139#L624-1true assume !(~e_e~0 == 1); 17#L629-1true assume ~e_f~0 == 1;~e_f~0 := 2; 40#L634-1true assume ~e_g~0 == 1;~e_g~0 := 2; 69#L639-1true assume ~e_c~0 == 1;~e_c~0 := 2; 88#L644-1true assume ~e_wl~0 == 1;~e_wl~0 := 2; 120#L649-1true assume ~wl_st~0 == 0; 86#L666-1true [2018-11-10 03:47:18,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-10 03:47:18,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,037 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1275402411, now seen corresponding path program 1 times [2018-11-10 03:47:19,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:47:19,046 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:47:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:47:19,062 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 2 states. [2018-11-10 03:47:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,074 INFO L93 Difference]: Finished difference Result 136 states and 230 transitions. [2018-11-10 03:47:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:47:19,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 230 transitions. [2018-11-10 03:47:19,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 131 states and 225 transitions. [2018-11-10 03:47:19,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 03:47:19,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 03:47:19,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 225 transitions. [2018-11-10 03:47:19,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,085 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 225 transitions. [2018-11-10 03:47:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 225 transitions. [2018-11-10 03:47:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 03:47:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 03:47:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 225 transitions. [2018-11-10 03:47:19,111 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 225 transitions. [2018-11-10 03:47:19,111 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 225 transitions. [2018-11-10 03:47:19,111 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:47:19,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 225 transitions. [2018-11-10 03:47:19,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,113 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-10 03:47:19,113 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-10 03:47:19,113 INFO L793 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; 306#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; 282#L398 assume !(~c_req_up~0 == 1); 284#L398-2 assume !(~wl_i~0 == 1);~wl_st~0 := 2; 290#L409-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 291#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 341#L419-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 382#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 398#L429-1 assume !(~e_f~0 == 0); 408#L434-1 assume !(~e_g~0 == 0); 336#L439-1 assume !(~e_e~0 == 0); 337#L444-1 assume !(~e_c~0 == 0); 378#L449-1 assume !(~e_wl~0 == 0); 396#L454-1 assume !(~wl_pc~0 == 1); 375#L466 assume !(~wl_pc~0 == 2); 376#L467 assume !(~c1_pc~0 == 1); 371#L477 assume !(~c2_pc~0 == 1); 316#L486 assume !(~wb_pc~0 == 1); 317#L495 assume !(~e_c~0 == 1); 392#L504-1 assume !(~e_e~0 == 1); 393#L509-1 assume !(~e_f~0 == 1); 404#L514-1 assume !(~e_g~0 == 1); 319#L519-1 assume !(~e_c~0 == 1); 320#L524-1 assume !(~e_wl~0 == 1); 365#L666-1 [2018-11-10 03:47:19,114 INFO L795 eck$LassoCheckResult]: Loop: 365#L666-1 assume true; 359#L535 assume !false; 360#L536 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; 353#L371 assume true; 307#L288-1 assume !false; 308#L289 assume !(~wl_st~0 == 0); 331#L293 assume !(~c1_st~0 == 0); 296#L296 assume !(~c2_st~0 == 0); 297#L299 assume !(~wb_st~0 == 0); 312#L302 assume !(~r_st~0 == 0); 288#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 289#L542 assume !(~c_req_up~0 == 1); 374#L542-2 start_simulation_~kernel_st~0 := 3; 386#L554 assume !(~e_f~0 == 0); 369#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 370#L559-1 assume ~e_e~0 == 0;~e_e~0 := 1; 391#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 403#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 313#L574-1 assume !(~wl_pc~0 == 1); 314#L586 assume !(~wl_pc~0 == 2); 293#L587 assume !(~c1_pc~0 == 1); 385#L597 assume !(~c2_pc~0 == 1); 339#L606 assume !(~wb_pc~0 == 1); 343#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 344#L624-1 assume !(~e_e~0 == 1); 304#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 305#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 354#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 389#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 399#L649-1 assume ~wl_st~0 == 0; 365#L666-1 [2018-11-10 03:47:19,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-10 03:47:19,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,145 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash -80320476, now seen corresponding path program 1 times [2018-11-10 03:47:19,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:19,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,174 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:19,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:19,174 INFO L87 Difference]: Start difference. First operand 131 states and 225 transitions. cyclomatic complexity: 95 Second operand 3 states. [2018-11-10 03:47:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,187 INFO L93 Difference]: Finished difference Result 131 states and 224 transitions. [2018-11-10 03:47:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:19,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 224 transitions. [2018-11-10 03:47:19,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 224 transitions. [2018-11-10 03:47:19,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 03:47:19,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 03:47:19,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 224 transitions. [2018-11-10 03:47:19,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,191 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 224 transitions. [2018-11-10 03:47:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 224 transitions. [2018-11-10 03:47:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 03:47:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 03:47:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 224 transitions. [2018-11-10 03:47:19,195 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 224 transitions. [2018-11-10 03:47:19,196 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 224 transitions. [2018-11-10 03:47:19,196 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:47:19,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 224 transitions. [2018-11-10 03:47:19,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,198 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-10 03:47:19,198 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-10 03:47:19,198 INFO L793 eck$LassoCheckResult]: Stem: 672#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; 575#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; 551#L398 assume !(~c_req_up~0 == 1); 553#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 559#L409-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 560#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 610#L419-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 651#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 667#L429-1 assume !(~e_f~0 == 0); 677#L434-1 assume !(~e_g~0 == 0); 605#L439-1 assume !(~e_e~0 == 0); 606#L444-1 assume !(~e_c~0 == 0); 647#L449-1 assume !(~e_wl~0 == 0); 665#L454-1 assume !(~wl_pc~0 == 1); 644#L466 assume !(~wl_pc~0 == 2); 645#L467 assume !(~c1_pc~0 == 1); 640#L477 assume !(~c2_pc~0 == 1); 585#L486 assume !(~wb_pc~0 == 1); 586#L495 assume !(~e_c~0 == 1); 661#L504-1 assume !(~e_e~0 == 1); 662#L509-1 assume !(~e_f~0 == 1); 673#L514-1 assume !(~e_g~0 == 1); 588#L519-1 assume !(~e_c~0 == 1); 589#L524-1 assume !(~e_wl~0 == 1); 634#L666-1 [2018-11-10 03:47:19,198 INFO L795 eck$LassoCheckResult]: Loop: 634#L666-1 assume true; 628#L535 assume !false; 629#L536 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; 622#L371 assume true; 576#L288-1 assume !false; 577#L289 assume !(~wl_st~0 == 0); 600#L293 assume !(~c1_st~0 == 0); 565#L296 assume !(~c2_st~0 == 0); 566#L299 assume !(~wb_st~0 == 0); 581#L302 assume !(~r_st~0 == 0); 557#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 558#L542 assume !(~c_req_up~0 == 1); 643#L542-2 start_simulation_~kernel_st~0 := 3; 655#L554 assume !(~e_f~0 == 0); 638#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 639#L559-1 assume ~e_e~0 == 0;~e_e~0 := 1; 660#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 671#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 582#L574-1 assume !(~wl_pc~0 == 1); 583#L586 assume !(~wl_pc~0 == 2); 564#L587 assume !(~c1_pc~0 == 1); 654#L597 assume !(~c2_pc~0 == 1); 608#L606 assume !(~wb_pc~0 == 1); 612#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 613#L624-1 assume !(~e_e~0 == 1); 573#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 574#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 623#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 658#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 668#L649-1 assume ~wl_st~0 == 0; 634#L666-1 [2018-11-10 03:47:19,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-10 03:47:19,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,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-10 03:47:19,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,229 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -80320476, now seen corresponding path program 2 times [2018-11-10 03:47:19,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,253 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:19,254 INFO L87 Difference]: Start difference. First operand 131 states and 224 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-10 03:47:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,262 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2018-11-10 03:47:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:19,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 223 transitions. [2018-11-10 03:47:19,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 223 transitions. [2018-11-10 03:47:19,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 03:47:19,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 03:47:19,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 223 transitions. [2018-11-10 03:47:19,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,266 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 223 transitions. [2018-11-10 03:47:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 223 transitions. [2018-11-10 03:47:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 03:47:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 03:47:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 223 transitions. [2018-11-10 03:47:19,271 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 223 transitions. [2018-11-10 03:47:19,271 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 223 transitions. [2018-11-10 03:47:19,271 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:47:19,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 223 transitions. [2018-11-10 03:47:19,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,273 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-10 03:47:19,273 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-10 03:47:19,274 INFO L793 eck$LassoCheckResult]: Stem: 941#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; 844#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; 823#L398 assume !(~c_req_up~0 == 1); 825#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 828#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 829#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 879#L419-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 920#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 936#L429-1 assume !(~e_f~0 == 0); 946#L434-1 assume !(~e_g~0 == 0); 874#L439-1 assume !(~e_e~0 == 0); 875#L444-1 assume !(~e_c~0 == 0); 916#L449-1 assume !(~e_wl~0 == 0); 934#L454-1 assume !(~wl_pc~0 == 1); 913#L466 assume !(~wl_pc~0 == 2); 914#L467 assume !(~c1_pc~0 == 1); 911#L477 assume !(~c2_pc~0 == 1); 854#L486 assume !(~wb_pc~0 == 1); 855#L495 assume !(~e_c~0 == 1); 930#L504-1 assume !(~e_e~0 == 1); 931#L509-1 assume !(~e_f~0 == 1); 942#L514-1 assume !(~e_g~0 == 1); 857#L519-1 assume !(~e_c~0 == 1); 858#L524-1 assume !(~e_wl~0 == 1); 904#L666-1 [2018-11-10 03:47:19,274 INFO L795 eck$LassoCheckResult]: Loop: 904#L666-1 assume true; 899#L535 assume !false; 900#L536 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; 891#L371 assume true; 845#L288-1 assume !false; 846#L289 assume !(~wl_st~0 == 0); 869#L293 assume !(~c1_st~0 == 0); 834#L296 assume !(~c2_st~0 == 0); 835#L299 assume !(~wb_st~0 == 0); 850#L302 assume !(~r_st~0 == 0); 826#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 827#L542 assume !(~c_req_up~0 == 1); 910#L542-2 start_simulation_~kernel_st~0 := 3; 924#L554 assume !(~e_f~0 == 0); 907#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 908#L559-1 assume ~e_e~0 == 0;~e_e~0 := 1; 929#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 940#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 851#L574-1 assume !(~wl_pc~0 == 1); 852#L586 assume !(~wl_pc~0 == 2); 833#L587 assume !(~c1_pc~0 == 1); 923#L597 assume !(~c2_pc~0 == 1); 877#L606 assume !(~wb_pc~0 == 1); 881#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 882#L624-1 assume !(~e_e~0 == 1); 842#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 843#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 892#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 927#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 937#L649-1 assume ~wl_st~0 == 0; 904#L666-1 [2018-11-10 03:47:19,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-10 03:47:19,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,302 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash -80320476, now seen corresponding path program 3 times [2018-11-10 03:47:19,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,332 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:19,332 INFO L87 Difference]: Start difference. First operand 131 states and 223 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-10 03:47:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,340 INFO L93 Difference]: Finished difference Result 131 states and 222 transitions. [2018-11-10 03:47:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:19,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 222 transitions. [2018-11-10 03:47:19,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 222 transitions. [2018-11-10 03:47:19,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 03:47:19,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 03:47:19,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 222 transitions. [2018-11-10 03:47:19,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,344 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 222 transitions. [2018-11-10 03:47:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 222 transitions. [2018-11-10 03:47:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 03:47:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 03:47:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 222 transitions. [2018-11-10 03:47:19,348 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 222 transitions. [2018-11-10 03:47:19,348 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 222 transitions. [2018-11-10 03:47:19,348 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:47:19,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 222 transitions. [2018-11-10 03:47:19,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 03:47:19,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,350 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-10 03:47:19,350 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-10 03:47:19,350 INFO L793 eck$LassoCheckResult]: Stem: 1210#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; 1116#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; 1092#L398 assume !(~c_req_up~0 == 1); 1094#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1097#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1098#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1148#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1189#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1205#L429-1 assume !(~e_f~0 == 0); 1215#L434-1 assume !(~e_g~0 == 0); 1143#L439-1 assume !(~e_e~0 == 0); 1144#L444-1 assume !(~e_c~0 == 0); 1185#L449-1 assume !(~e_wl~0 == 0); 1203#L454-1 assume !(~wl_pc~0 == 1); 1182#L466 assume !(~wl_pc~0 == 2); 1183#L467 assume !(~c1_pc~0 == 1); 1180#L477 assume !(~c2_pc~0 == 1); 1125#L486 assume !(~wb_pc~0 == 1); 1126#L495 assume !(~e_c~0 == 1); 1199#L504-1 assume !(~e_e~0 == 1); 1200#L509-1 assume !(~e_f~0 == 1); 1211#L514-1 assume !(~e_g~0 == 1); 1128#L519-1 assume !(~e_c~0 == 1); 1129#L524-1 assume !(~e_wl~0 == 1); 1173#L666-1 [2018-11-10 03:47:19,350 INFO L795 eck$LassoCheckResult]: Loop: 1173#L666-1 assume true; 1168#L535 assume !false; 1169#L536 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; 1160#L371 assume true; 1117#L288-1 assume !false; 1118#L289 assume !(~wl_st~0 == 0); 1138#L293 assume !(~c1_st~0 == 0); 1103#L296 assume !(~c2_st~0 == 0); 1104#L299 assume !(~wb_st~0 == 0); 1119#L302 assume !(~r_st~0 == 0); 1095#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1096#L542 assume !(~c_req_up~0 == 1); 1179#L542-2 start_simulation_~kernel_st~0 := 3; 1193#L554 assume !(~e_f~0 == 0); 1176#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 1177#L559-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1198#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1209#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1120#L574-1 assume !(~wl_pc~0 == 1); 1121#L586 assume !(~wl_pc~0 == 2); 1102#L587 assume !(~c1_pc~0 == 1); 1192#L597 assume !(~c2_pc~0 == 1); 1147#L606 assume !(~wb_pc~0 == 1); 1150#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 1151#L624-1 assume !(~e_e~0 == 1); 1114#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1115#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1161#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1196#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1206#L649-1 assume ~wl_st~0 == 0; 1173#L666-1 [2018-11-10 03:47:19,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-10 03:47:19,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:19,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -80320476, now seen corresponding path program 4 times [2018-11-10 03:47:19,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:19,405 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:19,405 INFO L87 Difference]: Start difference. First operand 131 states and 222 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-10 03:47:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,448 INFO L93 Difference]: Finished difference Result 159 states and 273 transitions. [2018-11-10 03:47:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:19,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 273 transitions. [2018-11-10 03:47:19,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2018-11-10 03:47:19,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 273 transitions. [2018-11-10 03:47:19,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2018-11-10 03:47:19,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-11-10 03:47:19,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 273 transitions. [2018-11-10 03:47:19,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,452 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 273 transitions. [2018-11-10 03:47:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 273 transitions. [2018-11-10 03:47:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-10 03:47:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 03:47:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 273 transitions. [2018-11-10 03:47:19,456 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 273 transitions. [2018-11-10 03:47:19,456 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 273 transitions. [2018-11-10 03:47:19,456 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:47:19,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 273 transitions. [2018-11-10 03:47:19,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2018-11-10 03:47:19,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,458 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-10 03:47:19,458 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-10 03:47:19,458 INFO L793 eck$LassoCheckResult]: Stem: 1508#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; 1412#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; 1388#L398 assume !(~c_req_up~0 == 1); 1390#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1393#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1394#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1445#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1486#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1503#L429-1 assume !(~e_f~0 == 0); 1513#L434-1 assume !(~e_g~0 == 0); 1439#L439-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1440#L444-1 assume !(~e_c~0 == 0); 1482#L449-1 assume !(~e_wl~0 == 0); 1502#L454-1 assume !(~wl_pc~0 == 1); 1479#L466 assume !(~wl_pc~0 == 2); 1480#L467 assume !(~c1_pc~0 == 1); 1477#L477 assume !(~c2_pc~0 == 1); 1421#L486 assume !(~wb_pc~0 == 1); 1422#L495 assume !(~e_c~0 == 1); 1497#L504-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1498#L509-1 assume !(~e_f~0 == 1); 1509#L514-1 assume !(~e_g~0 == 1); 1424#L519-1 assume !(~e_c~0 == 1); 1425#L524-1 assume !(~e_wl~0 == 1); 1470#L666-1 [2018-11-10 03:47:19,459 INFO L795 eck$LassoCheckResult]: Loop: 1470#L666-1 assume true; 1465#L535 assume !false; 1466#L536 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; 1457#L371 assume true; 1413#L288-1 assume !false; 1414#L289 assume !(~wl_st~0 == 0); 1434#L293 assume !(~c1_st~0 == 0); 1399#L296 assume !(~c2_st~0 == 0); 1400#L299 assume !(~wb_st~0 == 0); 1415#L302 assume !(~r_st~0 == 0); 1391#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1392#L542 assume !(~c_req_up~0 == 1); 1476#L542-2 start_simulation_~kernel_st~0 := 3; 1490#L554 assume !(~e_f~0 == 0); 1473#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 1474#L559-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1495#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1507#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1416#L574-1 assume !(~wl_pc~0 == 1); 1417#L586 assume !(~wl_pc~0 == 2); 1398#L587 assume !(~c1_pc~0 == 1); 1489#L597 assume !(~c2_pc~0 == 1); 1444#L606 assume !(~wb_pc~0 == 1); 1447#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 1448#L624-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1410#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1411#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1459#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1493#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1504#L649-1 assume ~wl_st~0 == 0; 1470#L666-1 [2018-11-10 03:47:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1264875287, now seen corresponding path program 1 times [2018-11-10 03:47:19,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:47:19,493 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -137578778, now seen corresponding path program 1 times [2018-11-10 03:47:19,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:47:19,514 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:19,514 INFO L87 Difference]: Start difference. First operand 159 states and 273 transitions. cyclomatic complexity: 115 Second operand 4 states. [2018-11-10 03:47:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,593 INFO L93 Difference]: Finished difference Result 248 states and 416 transitions. [2018-11-10 03:47:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:47:19,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 416 transitions. [2018-11-10 03:47:19,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 191 [2018-11-10 03:47:19,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 248 states and 416 transitions. [2018-11-10 03:47:19,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2018-11-10 03:47:19,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2018-11-10 03:47:19,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 416 transitions. [2018-11-10 03:47:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:19,600 INFO L705 BuchiCegarLoop]: Abstraction has 248 states and 416 transitions. [2018-11-10 03:47:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 416 transitions. [2018-11-10 03:47:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2018-11-10 03:47:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 03:47:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 394 transitions. [2018-11-10 03:47:19,607 INFO L728 BuchiCegarLoop]: Abstraction has 234 states and 394 transitions. [2018-11-10 03:47:19,608 INFO L608 BuchiCegarLoop]: Abstraction has 234 states and 394 transitions. [2018-11-10 03:47:19,608 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:47:19,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 394 transitions. [2018-11-10 03:47:19,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 191 [2018-11-10 03:47:19,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:19,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:19,610 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-10 03:47:19,610 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-10 03:47:19,610 INFO L793 eck$LassoCheckResult]: Stem: 1934#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; 1825#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; 1802#L398 assume !(~c_req_up~0 == 1); 1804#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1810#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1811#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1862#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1905#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1925#L429-1 assume !(~e_f~0 == 0); 1940#L434-1 assume !(~e_g~0 == 0); 1857#L439-1 assume !(~e_e~0 == 0); 1858#L444-1 assume !(~e_c~0 == 0); 1901#L449-1 assume !(~e_wl~0 == 0); 1922#L454-1 assume !(~wl_pc~0 == 1); 1898#L466 assume !(~wl_pc~0 == 2); 1899#L467 assume !(~c1_pc~0 == 1); 1948#L477 assume !(~c2_pc~0 == 1); 1964#L486 assume !(~wb_pc~0 == 1); 1962#L495 assume !(~e_c~0 == 1); 1960#L504-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1919#L509-1 assume !(~e_f~0 == 1); 1936#L514-1 assume !(~e_g~0 == 1); 1840#L519-1 assume !(~e_c~0 == 1); 1841#L524-1 assume !(~e_wl~0 == 1); 1886#L666-1 [2018-11-10 03:47:19,610 INFO L795 eck$LassoCheckResult]: Loop: 1886#L666-1 assume true; 1972#L535 assume !false; 1971#L536 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; 1890#L371 assume true; 1969#L288-1 assume !false; 1968#L289 assume !(~wl_st~0 == 0); 1967#L293 assume !(~c1_st~0 == 0); 1959#L296 assume !(~c2_st~0 == 0); 1958#L299 assume !(~wb_st~0 == 0); 1956#L302 assume !(~r_st~0 == 0); 1955#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1953#L542 assume !(~c_req_up~0 == 1); 1951#L542-2 start_simulation_~kernel_st~0 := 3; 1949#L554 assume !(~e_f~0 == 0); 1950#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 2022#L559-1 assume !(~e_e~0 == 0); 2021#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 2020#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 2019#L574-1 assume ~wl_pc~0 == 1; 2016#L580 assume ~e_wl~0 == 1;~wl_st~0 := 0; 2015#L587 assume !(~c1_pc~0 == 1); 2013#L597 assume !(~c2_pc~0 == 1); 2011#L606 assume !(~wb_pc~0 == 1); 2009#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 2008#L624-1 assume !(~e_e~0 == 1); 1831#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1832#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1876#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1914#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1930#L649-1 assume ~wl_st~0 == 0; 1886#L666-1 [2018-11-10 03:47:19,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash 253758037, now seen corresponding path program 1 times [2018-11-10 03:47:19,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:19,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:19,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:47:19,643 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:19,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1909443875, now seen corresponding path program 1 times [2018-11-10 03:47:19,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:19,832 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-10 03:47:19,899 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:19,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:19,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:19,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:19,901 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:47:19,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:19,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:19,901 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:19,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 03:47:19,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:19,902 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:19,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,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-10 03:47:19,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,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-10 03:47:19,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:19,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-10 03:47:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,138 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:20,139 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:20,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:20,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:20,150 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:20,150 INFO L446 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:20,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:20,166 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:20,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:47:20,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:20,190 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:47:20,205 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:20,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:20,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:20,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:20,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:20,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:20,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:20,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:20,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 03:47:20,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:20,206 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:20,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-10 03:47:20,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,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-10 03:47:20,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,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-10 03:47:20,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,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-10 03:47:20,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:20,504 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:20,508 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:20,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:20,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:20,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:20,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:20,512 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:20,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:20,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:20,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:20,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:20,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:20,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:20,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:20,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:20,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:20,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:20,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:20,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:20,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:20,524 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:47:20,524 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 03:47:20,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:20,526 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:47:20,526 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:20,527 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-10 03:47:20,528 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:47:20,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:20,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:47:20,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 234 states and 394 transitions. cyclomatic complexity: 162 Second operand 5 states. [2018-11-10 03:47:20,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 234 states and 394 transitions. cyclomatic complexity: 162. Second operand 5 states. Result 819 states and 1369 transitions. Complement of second has 5 states. [2018-11-10 03:47:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:47:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2018-11-10 03:47:20,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 386 transitions. Stem has 24 letters. Loop has 30 letters. [2018-11-10 03:47:20,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:20,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 386 transitions. Stem has 54 letters. Loop has 30 letters. [2018-11-10 03:47:20,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:20,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 386 transitions. Stem has 24 letters. Loop has 60 letters. [2018-11-10 03:47:20,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:20,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1369 transitions. [2018-11-10 03:47:20,709 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 573 [2018-11-10 03:47:20,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 819 states and 1369 transitions. [2018-11-10 03:47:20,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2018-11-10 03:47:20,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 624 [2018-11-10 03:47:20,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 819 states and 1369 transitions. [2018-11-10 03:47:20,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:20,713 INFO L705 BuchiCegarLoop]: Abstraction has 819 states and 1369 transitions. [2018-11-10 03:47:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states and 1369 transitions. [2018-11-10 03:47:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 622. [2018-11-10 03:47:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 03:47:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1042 transitions. [2018-11-10 03:47:20,726 INFO L728 BuchiCegarLoop]: Abstraction has 622 states and 1042 transitions. [2018-11-10 03:47:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:20,726 INFO L87 Difference]: Start difference. First operand 622 states and 1042 transitions. Second operand 4 states. [2018-11-10 03:47:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:20,788 INFO L93 Difference]: Finished difference Result 1152 states and 1870 transitions. [2018-11-10 03:47:20,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:47:20,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1152 states and 1870 transitions. [2018-11-10 03:47:20,793 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 720 [2018-11-10 03:47:20,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1152 states to 1152 states and 1870 transitions. [2018-11-10 03:47:20,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 788 [2018-11-10 03:47:20,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 [2018-11-10 03:47:20,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1152 states and 1870 transitions. [2018-11-10 03:47:20,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:20,798 INFO L705 BuchiCegarLoop]: Abstraction has 1152 states and 1870 transitions. [2018-11-10 03:47:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states and 1870 transitions. [2018-11-10 03:47:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2018-11-10 03:47:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-11-10 03:47:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1870 transitions. [2018-11-10 03:47:20,811 INFO L728 BuchiCegarLoop]: Abstraction has 1152 states and 1870 transitions. [2018-11-10 03:47:20,811 INFO L608 BuchiCegarLoop]: Abstraction has 1152 states and 1870 transitions. [2018-11-10 03:47:20,811 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:47:20,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1152 states and 1870 transitions. [2018-11-10 03:47:20,815 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 720 [2018-11-10 03:47:20,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:20,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:20,816 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-10 03:47:20,816 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-10 03:47:20,816 INFO L793 eck$LassoCheckResult]: Stem: 5082#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; 4866#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; 4822#L398 assume !(~c_req_up~0 == 1); 4824#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 4839#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 4929#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 4930#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 5058#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 5059#L429-1 assume !(~e_f~0 == 0); 5135#L434-1 assume !(~e_g~0 == 0); 5136#L439-1 assume !(~e_e~0 == 0); 5005#L444-1 assume ~e_c~0 == 0;~e_c~0 := 1; 5006#L449-1 assume !(~e_wl~0 == 0); 5155#L454-1 assume !(~wl_pc~0 == 1); 5153#L466 assume !(~wl_pc~0 == 2); 5151#L467 assume !(~c1_pc~0 == 1); 5149#L477 assume !(~c2_pc~0 == 1); 5147#L486 assume !(~wb_pc~0 == 1); 5144#L495 assume !(~e_c~0 == 1); 5145#L504-1 assume !(~e_e~0 == 1); 5090#L509-1 assume ~e_f~0 == 1;~e_f~0 := 2; 5091#L514-1 assume !(~e_g~0 == 1); 5129#L519-1 assume !(~e_c~0 == 1); 4981#L524-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 4982#L666-1 [2018-11-10 03:47:20,816 INFO L795 eck$LassoCheckResult]: Loop: 4982#L666-1 assume true; 5061#L535 assume !false; 5127#L536 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; 4951#L371 assume true; 4867#L288-1 assume !false; 4868#L289 assume !(~wl_st~0 == 0); 5910#L293 assume !(~c1_st~0 == 0); 4840#L296 assume !(~c2_st~0 == 0); 4841#L299 assume !(~wb_st~0 == 0); 5140#L302 assume !(~r_st~0 == 0); 4825#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 4826#L542 assume !(~c_req_up~0 == 1); 5087#L542-2 start_simulation_~kernel_st~0 := 3; 5088#L554 assume !(~e_f~0 == 0); 5908#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 5940#L559-1 assume !(~e_e~0 == 0); 5939#L564-1 assume ~e_c~0 == 0;~e_c~0 := 1; 5403#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 5938#L574-1 assume !(~wl_pc~0 == 1); 5936#L586 assume !(~wl_pc~0 == 2); 5934#L587 assume !(~c1_pc~0 == 1); 5932#L597 assume !(~c2_pc~0 == 1); 5389#L606 assume !(~wb_pc~0 == 1); 5387#L615 assume ~e_c~0 == 1;~r_st~0 := 0; 5143#L624-1 assume !(~e_e~0 == 1); 4862#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 4863#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 4955#L639-1 assume ~e_c~0 == 1;~e_c~0 := 2; 5040#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 5064#L649-1 assume ~wl_st~0 == 0; 4982#L666-1 [2018-11-10 03:47:20,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash 842351509, now seen corresponding path program 1 times [2018-11-10 03:47:20,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:20,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:20,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:20,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:47:20,849 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:20,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1360184154, now seen corresponding path program 1 times [2018-11-10 03:47:20,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:20,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:20,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:47:20,864 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:20,865 INFO L87 Difference]: Start difference. First operand 1152 states and 1870 transitions. cyclomatic complexity: 730 Second operand 4 states. [2018-11-10 03:47:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:20,943 INFO L93 Difference]: Finished difference Result 1465 states and 2342 transitions. [2018-11-10 03:47:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:47:20,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1465 states and 2342 transitions. [2018-11-10 03:47:20,951 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 910 [2018-11-10 03:47:20,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1465 states to 1465 states and 2342 transitions. [2018-11-10 03:47:20,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1002 [2018-11-10 03:47:20,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1002 [2018-11-10 03:47:20,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1465 states and 2342 transitions. [2018-11-10 03:47:20,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:20,960 INFO L705 BuchiCegarLoop]: Abstraction has 1465 states and 2342 transitions. [2018-11-10 03:47:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states and 2342 transitions. [2018-11-10 03:47:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1429. [2018-11-10 03:47:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2018-11-10 03:47:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2300 transitions. [2018-11-10 03:47:20,986 INFO L728 BuchiCegarLoop]: Abstraction has 1429 states and 2300 transitions. [2018-11-10 03:47:20,986 INFO L608 BuchiCegarLoop]: Abstraction has 1429 states and 2300 transitions. [2018-11-10 03:47:20,986 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:47:20,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 2300 transitions. [2018-11-10 03:47:20,991 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 910 [2018-11-10 03:47:20,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:20,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:20,992 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-10 03:47:20,992 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-10 03:47:20,992 INFO L793 eck$LassoCheckResult]: Stem: 7724#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; 7499#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; 7449#L398 assume !(~c_req_up~0 == 1); 7451#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 7787#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 7556#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 7557#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 7700#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 7701#L429-1 assume !(~e_f~0 == 0); 7786#L434-1 assume !(~e_g~0 == 0); 7547#L439-1 assume !(~e_e~0 == 0); 7548#L444-1 assume !(~e_c~0 == 0); 7637#L449-1 assume !(~e_wl~0 == 0); 7737#L454-1 assume !(~wl_pc~0 == 1); 7738#L466 assume !(~wl_pc~0 == 2); 7774#L467 assume !(~c1_pc~0 == 1); 7773#L477 assume !(~c2_pc~0 == 1); 7514#L486 assume !(~wb_pc~0 == 1); 7515#L495 assume !(~e_c~0 == 1); 7689#L504-1 assume !(~e_e~0 == 1); 7690#L509-1 assume ~e_f~0 == 1;~e_f~0 := 2; 7793#L514-1 assume !(~e_g~0 == 1); 7517#L519-1 assume !(~e_c~0 == 1); 7518#L524-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 8079#L666-1 [2018-11-10 03:47:20,992 INFO L795 eck$LassoCheckResult]: Loop: 8079#L666-1 assume true; 8638#L535 assume !false; 8637#L536 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; 8572#L371 assume true; 8636#L288-1 assume !false; 8632#L289 assume !(~wl_st~0 == 0); 8633#L293 assume !(~c1_st~0 == 0); 8635#L296 assume !(~c2_st~0 == 0); 8630#L299 assume !(~wb_st~0 == 0); 8631#L302 assume !(~r_st~0 == 0); 8634#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 8671#L542 assume !(~c_req_up~0 == 1); 8669#L542-2 start_simulation_~kernel_st~0 := 3; 8668#L554 assume !(~e_f~0 == 0); 8667#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 8666#L559-1 assume !(~e_e~0 == 0); 8665#L564-1 assume !(~e_c~0 == 0); 8664#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 8663#L574-1 assume ~wl_pc~0 == 1; 8658#L580 assume ~e_wl~0 == 1;~wl_st~0 := 0; 8657#L587 assume !(~c1_pc~0 == 1); 8655#L597 assume !(~c2_pc~0 == 1); 8653#L606 assume !(~wb_pc~0 == 1); 8651#L615 assume !(~e_c~0 == 1); 8650#L624-1 assume !(~e_e~0 == 1); 8649#L629-1 assume ~e_f~0 == 1;~e_f~0 := 2; 8646#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 8645#L639-1 assume !(~e_c~0 == 1); 8644#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 8643#L649-1 assume ~wl_st~0 == 0; 8079#L666-1 [2018-11-10 03:47:20,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2018-11-10 03:47:20,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:20,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:20,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:20,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:21,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:21,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:47:21,020 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1145551841, now seen corresponding path program 1 times [2018-11-10 03:47:21,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:21,153 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:21,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:21,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:21,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:21,154 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:47:21,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:21,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:21,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:21,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-10 03:47:21,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:21,154 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:21,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,415 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:21,415 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:21,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,425 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,428 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,428 INFO L446 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,464 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,464 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,493 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,497 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,497 INFO L446 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,560 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,560 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,572 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,572 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-8} Honda state: {~c1_st~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,603 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,603 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_e~0=-1} Honda state: {~e_e~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,634 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:21,635 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:21,668 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/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-10 03:47:21,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:47:21,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:21,699 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:47:21,724 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:21,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:21,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:21,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:21,725 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:21,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:21,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:21,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:21,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-10 03:47:21,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:21,725 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:21,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-10 03:47:21,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-10 03:47:21,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,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-10 03:47:21,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-10 03:47:21,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-10 03:47:21,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,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-10 03:47:21,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-10 03:47:21,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-10 03:47:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:21,969 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:21,969 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:21,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:21,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:21,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,972 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:21,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,973 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:21,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:21,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:21,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:21,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:21,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,980 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:21,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:21,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,982 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:21,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:21,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,984 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:21,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:21,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:21,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:21,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:21,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:21,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:21,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:21,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:21,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:21,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:21,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:21,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:21,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:21,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:21,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:47:21,994 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 03:47:21,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:21,994 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:47:21,994 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:21,994 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_wl~0) = -1*~e_wl~0 + 1 Supporting invariants [] [2018-11-10 03:47:21,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:47:22,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:47:22,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1429 states and 2300 transitions. cyclomatic complexity: 886 Second operand 5 states. [2018-11-10 03:47:22,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1429 states and 2300 transitions. cyclomatic complexity: 886. Second operand 5 states. Result 2578 states and 4159 transitions. Complement of second has 5 states. [2018-11-10 03:47:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:47:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2018-11-10 03:47:22,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 30 letters. [2018-11-10 03:47:22,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:22,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 54 letters. Loop has 30 letters. [2018-11-10 03:47:22,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:22,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 60 letters. [2018-11-10 03:47:22,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:22,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2578 states and 4159 transitions. [2018-11-10 03:47:22,120 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 1549 [2018-11-10 03:47:22,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2578 states to 2573 states and 4149 transitions. [2018-11-10 03:47:22,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1635 [2018-11-10 03:47:22,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1659 [2018-11-10 03:47:22,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2573 states and 4149 transitions. [2018-11-10 03:47:22,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:22,129 INFO L705 BuchiCegarLoop]: Abstraction has 2573 states and 4149 transitions. [2018-11-10 03:47:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states and 4149 transitions. [2018-11-10 03:47:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2340. [2018-11-10 03:47:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2018-11-10 03:47:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 3780 transitions. [2018-11-10 03:47:22,162 INFO L728 BuchiCegarLoop]: Abstraction has 2340 states and 3780 transitions. [2018-11-10 03:47:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:22,162 INFO L87 Difference]: Start difference. First operand 2340 states and 3780 transitions. Second operand 4 states. [2018-11-10 03:47:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:22,241 INFO L93 Difference]: Finished difference Result 2607 states and 4105 transitions. [2018-11-10 03:47:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:47:22,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2607 states and 4105 transitions. [2018-11-10 03:47:22,251 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1480 [2018-11-10 03:47:22,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2607 states to 2607 states and 4105 transitions. [2018-11-10 03:47:22,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1587 [2018-11-10 03:47:22,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1587 [2018-11-10 03:47:22,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2607 states and 4105 transitions. [2018-11-10 03:47:22,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:22,260 INFO L705 BuchiCegarLoop]: Abstraction has 2607 states and 4105 transitions. [2018-11-10 03:47:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states and 4105 transitions. [2018-11-10 03:47:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2531. [2018-11-10 03:47:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2018-11-10 03:47:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4017 transitions. [2018-11-10 03:47:22,308 INFO L728 BuchiCegarLoop]: Abstraction has 2531 states and 4017 transitions. [2018-11-10 03:47:22,308 INFO L608 BuchiCegarLoop]: Abstraction has 2531 states and 4017 transitions. [2018-11-10 03:47:22,308 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:47:22,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2531 states and 4017 transitions. [2018-11-10 03:47:22,314 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1474 [2018-11-10 03:47:22,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:22,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:22,314 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-10 03:47:22,314 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-10 03:47:22,315 INFO L793 eck$LassoCheckResult]: Stem: 16846#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; 16628#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; 16584#L398 assume !(~c_req_up~0 == 1); 16586#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 16597#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 16598#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 16779#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 16780#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 16866#L429-1 assume !(~e_f~0 == 0); 16867#L434-1 assume !(~e_g~0 == 0); 16888#L439-1 assume !(~e_e~0 == 0); 16766#L444-1 assume !(~e_c~0 == 0); 16767#L449-1 assume !(~e_wl~0 == 0); 16855#L454-1 assume !(~wl_pc~0 == 1); 16856#L466 assume !(~wl_pc~0 == 2); 16887#L467 assume !(~c1_pc~0 == 1); 16886#L477 assume !(~c2_pc~0 == 1); 16647#L486 assume !(~wb_pc~0 == 1); 16648#L495 assume !(~e_c~0 == 1); 16815#L504-1 assume !(~e_e~0 == 1); 16816#L509-1 assume !(~e_f~0 == 1); 16883#L514-1 assume !(~e_g~0 == 1); 16650#L519-1 assume !(~e_c~0 == 1); 16651#L524-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 17160#L666-1 assume true; 17389#L535 [2018-11-10 03:47:22,315 INFO L795 eck$LassoCheckResult]: Loop: 17389#L535 assume !false; 17943#L536 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; 17940#L371 assume true; 17939#L288-1 assume !false; 17935#L289 assume !(~wl_st~0 == 0); 17936#L293 assume !(~c1_st~0 == 0); 17938#L296 assume !(~c2_st~0 == 0); 17933#L299 assume !(~wb_st~0 == 0); 17934#L302 assume !(~r_st~0 == 0); 17937#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 18004#L542 assume !(~c_req_up~0 == 1); 18002#L542-2 start_simulation_~kernel_st~0 := 3; 18001#L554 assume !(~e_f~0 == 0); 18000#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 17999#L559-1 assume !(~e_e~0 == 0); 17998#L564-1 assume !(~e_c~0 == 0); 17997#L569-1 assume !(~e_wl~0 == 0); 17996#L574-1 assume ~wl_pc~0 == 1; 17993#L580 assume ~e_wl~0 == 1;~wl_st~0 := 0; 17992#L587 assume !(~c1_pc~0 == 1); 17989#L597 assume !(~c2_pc~0 == 1); 17983#L606 assume !(~wb_pc~0 == 1); 17980#L615 assume !(~e_c~0 == 1); 17978#L624-1 assume !(~e_e~0 == 1); 17968#L629-1 assume !(~e_f~0 == 1); 17963#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 17961#L639-1 assume !(~e_c~0 == 1); 17959#L644-1 assume !(~e_wl~0 == 1); 17957#L649-1 assume ~wl_st~0 == 0; 17751#L666-1 assume true; 17389#L535 [2018-11-10 03:47:22,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -666177031, now seen corresponding path program 1 times [2018-11-10 03:47:22,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:22,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:22,337 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:22,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -654968671, now seen corresponding path program 1 times [2018-11-10 03:47:22,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:22,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:22,365 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:22,365 INFO L87 Difference]: Start difference. First operand 2531 states and 4017 transitions. cyclomatic complexity: 1511 Second operand 3 states. [2018-11-10 03:47:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:22,387 INFO L93 Difference]: Finished difference Result 2439 states and 3801 transitions. [2018-11-10 03:47:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:22,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2439 states and 3801 transitions. [2018-11-10 03:47:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1404 [2018-11-10 03:47:22,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2439 states to 2439 states and 3801 transitions. [2018-11-10 03:47:22,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1464 [2018-11-10 03:47:22,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1464 [2018-11-10 03:47:22,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2439 states and 3801 transitions. [2018-11-10 03:47:22,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:22,401 INFO L705 BuchiCegarLoop]: Abstraction has 2439 states and 3801 transitions. [2018-11-10 03:47:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states and 3801 transitions. [2018-11-10 03:47:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2427. [2018-11-10 03:47:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2427 states. [2018-11-10 03:47:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3789 transitions. [2018-11-10 03:47:22,423 INFO L728 BuchiCegarLoop]: Abstraction has 2427 states and 3789 transitions. [2018-11-10 03:47:22,423 INFO L608 BuchiCegarLoop]: Abstraction has 2427 states and 3789 transitions. [2018-11-10 03:47:22,423 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:47:22,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2427 states and 3789 transitions. [2018-11-10 03:47:22,429 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1397 [2018-11-10 03:47:22,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:22,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:22,429 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-10 03:47:22,430 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-10 03:47:22,430 INFO L793 eck$LassoCheckResult]: Stem: 21839#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; 21617#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; 21567#L398 assume !(~c_req_up~0 == 1); 21569#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 21896#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 21674#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 21675#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 21817#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 21818#L429-1 assume !(~e_f~0 == 0); 21881#L434-1 assume !(~e_g~0 == 0); 21882#L439-1 assume !(~e_e~0 == 0); 21755#L444-1 assume !(~e_c~0 == 0); 21756#L449-1 assume !(~e_wl~0 == 0); 21847#L454-1 assume !(~wl_pc~0 == 1); 21812#L466 assume !(~wl_pc~0 == 2); 21880#L467 assume !(~c1_pc~0 == 1); 21879#L477 assume !(~c2_pc~0 == 1); 21632#L486 assume !(~wb_pc~0 == 1); 21633#L495 assume !(~e_c~0 == 1); 21806#L504-1 assume !(~e_e~0 == 1); 21807#L509-1 assume !(~e_f~0 == 1); 21843#L514-1 assume !(~e_g~0 == 1); 21635#L519-1 assume !(~e_c~0 == 1); 21636#L524-1 assume !(~e_wl~0 == 1); 22482#L666-1 assume true; 22483#L535 [2018-11-10 03:47:22,430 INFO L795 eck$LassoCheckResult]: Loop: 22483#L535 assume !false; 23170#L536 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; 23159#L371 assume true; 23160#L288-1 assume !false; 23149#L289 assume !(~wl_st~0 == 0); 23150#L293 assume !(~c1_st~0 == 0); 23141#L296 assume !(~c2_st~0 == 0); 23142#L299 assume !(~wb_st~0 == 0); 23135#L302 assume !(~r_st~0 == 0); 23137#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 23131#L542 assume !(~c_req_up~0 == 1); 23132#L542-2 start_simulation_~kernel_st~0 := 3; 23267#L554 assume !(~e_f~0 == 0); 23265#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 23263#L559-1 assume !(~e_e~0 == 0); 23261#L564-1 assume !(~e_c~0 == 0); 23259#L569-1 assume !(~e_wl~0 == 0); 23257#L574-1 assume !(~wl_pc~0 == 1); 23252#L586 assume !(~wl_pc~0 == 2); 23249#L587 assume !(~c1_pc~0 == 1); 23245#L597 assume !(~c2_pc~0 == 1); 23241#L606 assume !(~wb_pc~0 == 1); 23237#L615 assume !(~e_c~0 == 1); 23231#L624-1 assume !(~e_e~0 == 1); 23232#L629-1 assume !(~e_f~0 == 1); 23223#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 23224#L639-1 assume !(~e_c~0 == 1); 23218#L644-1 assume !(~e_wl~0 == 1); 23216#L649-1 assume ~wl_st~0 == 0; 23274#L666-1 assume true; 22483#L535 [2018-11-10 03:47:22,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 1 times [2018-11-10 03:47:22,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -807786504, now seen corresponding path program 1 times [2018-11-10 03:47:22,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:22,452 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:22,453 INFO L87 Difference]: Start difference. First operand 2427 states and 3789 transitions. cyclomatic complexity: 1374 Second operand 3 states. [2018-11-10 03:47:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:22,478 INFO L93 Difference]: Finished difference Result 3710 states and 5703 transitions. [2018-11-10 03:47:22,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:22,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3710 states and 5703 transitions. [2018-11-10 03:47:22,486 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 2132 [2018-11-10 03:47:22,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3710 states to 3710 states and 5703 transitions. [2018-11-10 03:47:22,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2206 [2018-11-10 03:47:22,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2206 [2018-11-10 03:47:22,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3710 states and 5703 transitions. [2018-11-10 03:47:22,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:22,498 INFO L705 BuchiCegarLoop]: Abstraction has 3710 states and 5703 transitions. [2018-11-10 03:47:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states and 5703 transitions. [2018-11-10 03:47:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3623. [2018-11-10 03:47:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2018-11-10 03:47:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 5580 transitions. [2018-11-10 03:47:22,533 INFO L728 BuchiCegarLoop]: Abstraction has 3623 states and 5580 transitions. [2018-11-10 03:47:22,533 INFO L608 BuchiCegarLoop]: Abstraction has 3623 states and 5580 transitions. [2018-11-10 03:47:22,533 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:47:22,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3623 states and 5580 transitions. [2018-11-10 03:47:22,539 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 2126 [2018-11-10 03:47:22,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:22,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:22,540 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-10 03:47:22,540 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-10 03:47:22,540 INFO L793 eck$LassoCheckResult]: Stem: 27983#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; 27760#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; 27710#L398 assume !(~c_req_up~0 == 1); 27712#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 28045#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 27817#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 27818#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 27960#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 27961#L429-1 assume !(~e_f~0 == 0); 28028#L434-1 assume !(~e_g~0 == 0); 28029#L439-1 assume !(~e_e~0 == 0); 27895#L444-1 assume !(~e_c~0 == 0); 27896#L449-1 assume !(~e_wl~0 == 0); 27995#L454-1 assume !(~wl_pc~0 == 1); 27955#L466 assume !(~wl_pc~0 == 2); 28025#L467 assume !(~c1_pc~0 == 1); 28024#L477 assume !(~c2_pc~0 == 1); 27776#L486 assume !(~wb_pc~0 == 1); 27777#L495 assume !(~e_c~0 == 1); 27949#L504-1 assume !(~e_e~0 == 1); 27950#L509-1 assume !(~e_f~0 == 1); 27990#L514-1 assume !(~e_g~0 == 1); 27779#L519-1 assume !(~e_c~0 == 1); 27780#L524-1 assume !(~e_wl~0 == 1); 28251#L666-1 assume true; 28252#L535 [2018-11-10 03:47:22,540 INFO L795 eck$LassoCheckResult]: Loop: 28252#L535 assume !false; 30356#L536 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; 30354#L371 assume true; 30353#L288-1 assume !false; 30352#L289 assume ~wl_st~0 == 0; 30350#L302-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 30348#L315 assume eval_~tmp~0 != 0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 30346#L56 assume ~wl_pc~0 == 0; 30344#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 30343#L121 assume { :end_inline_write_loop } true; 30342#L311 assume !(~c1_st~0 == 0); 30160#L326 assume !(~c2_st~0 == 0); 30138#L341 assume !(~wb_st~0 == 0); 30139#L356 assume !(~r_st~0 == 0); 29999#L371 assume true; 30000#L288-1 assume !false; 29988#L289 assume !(~wl_st~0 == 0); 29987#L293 assume !(~c1_st~0 == 0); 29922#L296 assume !(~c2_st~0 == 0); 29923#L299 assume !(~wb_st~0 == 0); 29904#L302 assume !(~r_st~0 == 0); 29906#L387 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 29893#L542 assume !(~c_req_up~0 == 1); 29894#L542-2 start_simulation_~kernel_st~0 := 3; 30303#L554 assume !(~e_f~0 == 0); 30301#L554-2 assume ~e_g~0 == 0;~e_g~0 := 1; 30299#L559-1 assume !(~e_e~0 == 0); 30297#L564-1 assume !(~e_c~0 == 0); 30295#L569-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 30293#L574-1 assume ~wl_pc~0 == 1; 30291#L580 assume ~e_wl~0 == 1;~wl_st~0 := 0; 30292#L587 assume !(~c1_pc~0 == 1); 30465#L597 assume !(~c2_pc~0 == 1); 30433#L606 assume !(~wb_pc~0 == 1); 30418#L615 assume !(~e_c~0 == 1); 30419#L624-1 assume !(~e_e~0 == 1); 30263#L629-1 assume !(~e_f~0 == 1); 30264#L634-1 assume ~e_g~0 == 1;~e_g~0 := 2; 30256#L639-1 assume !(~e_c~0 == 1); 30249#L644-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 30250#L649-1 assume ~wl_st~0 == 0; 30402#L666-1 assume true; 28252#L535 [2018-11-10 03:47:22,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 2 times [2018-11-10 03:47:22,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1237797887, now seen corresponding path program 1 times [2018-11-10 03:47:22,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:22,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:22,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash -930970953, now seen corresponding path program 1 times [2018-11-10 03:47:22,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:22,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:22,695 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:22,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:22,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:22,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:22,696 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:47:22,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:22,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:22,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-10 03:47:22,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:22,696 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:22,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,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-10 03:47:22,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,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-10 03:47:22,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,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-10 03:47:22,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-10 03:47:22,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-10 03:47:22,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:22,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-10 03:47:22,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-10 03:47:22,898 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:22,898 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:22,912 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:22,916 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:22,916 INFO L446 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:22,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:22,936 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:22,936 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:22,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:22,954 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:22,954 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:22,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:22,973 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:22,973 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:22,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:22,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:22,992 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:22,993 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=-8} Honda state: {ULTIMATE.start_eval_~tmp~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:23,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:23,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:23,019 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:47:23,019 INFO L446 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_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:23,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:47:23,048 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:23,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:47:23,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:47:23,071 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:47:23,095 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:23,096 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:23,096 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:23,096 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:23,096 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:23,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:23,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:23,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:23,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-10 03:47:23,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:23,096 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:23,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,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-10 03:47:23,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,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-10 03:47:23,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-10 03:47:23,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:23,370 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:23,370 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:23,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:23,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:23,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,374 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:23,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:23,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:23,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:23,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:23,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:23,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:23,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:23,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,384 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:47:23,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:47:23,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:23,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:47:23,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:23,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:23,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:23,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:23,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:23,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:23,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:23,388 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:23,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:47:23,390 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 03:47:23,390 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:23,390 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:47:23,390 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:23,390 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2018-11-10 03:47:23,391 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:47:23,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:23,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:23,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:23,528 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-10 03:47:23,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:47:23,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3623 states and 5580 transitions. cyclomatic complexity: 1975 Second operand 5 states. [2018-11-10 03:47:23,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3623 states and 5580 transitions. cyclomatic complexity: 1975. Second operand 5 states. Result 9549 states and 14692 transitions. Complement of second has 7 states. [2018-11-10 03:47:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:47:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2018-11-10 03:47:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 209 transitions. Stem has 25 letters. Loop has 42 letters. [2018-11-10 03:47:23,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 209 transitions. Stem has 67 letters. Loop has 42 letters. [2018-11-10 03:47:23,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:23,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 209 transitions. Stem has 25 letters. Loop has 84 letters. [2018-11-10 03:47:23,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:23,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9549 states and 14692 transitions. [2018-11-10 03:47:23,690 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 3808 [2018-11-10 03:47:23,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9549 states to 9359 states and 14392 transitions. [2018-11-10 03:47:23,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4036 [2018-11-10 03:47:23,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4044 [2018-11-10 03:47:23,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9359 states and 14392 transitions. [2018-11-10 03:47:23,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:23,735 INFO L705 BuchiCegarLoop]: Abstraction has 9359 states and 14392 transitions. [2018-11-10 03:47:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states and 14392 transitions. [2018-11-10 03:47:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9161. [2018-11-10 03:47:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9161 states. [2018-11-10 03:47:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9161 states to 9161 states and 14088 transitions. [2018-11-10 03:47:23,877 INFO L728 BuchiCegarLoop]: Abstraction has 9161 states and 14088 transitions. [2018-11-10 03:47:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:23,877 INFO L87 Difference]: Start difference. First operand 9161 states and 14088 transitions. Second operand 3 states. [2018-11-10 03:47:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:24,020 INFO L93 Difference]: Finished difference Result 14228 states and 21667 transitions. [2018-11-10 03:47:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:24,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14228 states and 21667 transitions. [2018-11-10 03:47:24,064 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5926 [2018-11-10 03:47:24,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14228 states to 14228 states and 21667 transitions. [2018-11-10 03:47:24,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6086 [2018-11-10 03:47:24,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6086 [2018-11-10 03:47:24,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14228 states and 21667 transitions. [2018-11-10 03:47:24,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:24,109 INFO L705 BuchiCegarLoop]: Abstraction has 14228 states and 21667 transitions. [2018-11-10 03:47:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14228 states and 21667 transitions. [2018-11-10 03:47:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14228 to 14228. [2018-11-10 03:47:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14228 states. [2018-11-10 03:47:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14228 states to 14228 states and 21667 transitions. [2018-11-10 03:47:24,264 INFO L728 BuchiCegarLoop]: Abstraction has 14228 states and 21667 transitions. [2018-11-10 03:47:24,264 INFO L608 BuchiCegarLoop]: Abstraction has 14228 states and 21667 transitions. [2018-11-10 03:47:24,264 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:47:24,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14228 states and 21667 transitions. [2018-11-10 03:47:24,296 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5926 [2018-11-10 03:47:24,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:24,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:24,297 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-10 03:47:24,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:24,297 INFO L793 eck$LassoCheckResult]: Stem: 64741#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; 64535#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; 64493#L398 assume !(~c_req_up~0 == 1); 64495#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 64794#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 64603#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 64604#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 64685#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 64725#L429-1 assume !(~e_f~0 == 0); 64756#L434-1 assume !(~e_g~0 == 0); 64595#L439-1 assume !(~e_e~0 == 0); 64596#L444-1 assume !(~e_c~0 == 0); 64675#L449-1 assume !(~e_wl~0 == 0); 64748#L454-1 assume !(~wl_pc~0 == 1); 64672#L466 assume !(~wl_pc~0 == 2); 64673#L467 assume !(~c1_pc~0 == 1); 64666#L477 assume !(~c2_pc~0 == 1); 64558#L486 assume !(~wb_pc~0 == 1); 64559#L495 assume !(~e_c~0 == 1); 64716#L504-1 assume !(~e_e~0 == 1); 64717#L509-1 assume !(~e_f~0 == 1); 64745#L514-1 assume !(~e_g~0 == 1); 64561#L519-1 assume !(~e_c~0 == 1); 64562#L524-1 assume !(~e_wl~0 == 1); 64653#L666-1 assume true; 67877#L535 assume !false; 72239#L536 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; 72234#L371 [2018-11-10 03:47:24,297 INFO L795 eck$LassoCheckResult]: Loop: 72234#L371 assume true; 72229#L288-1 assume !false; 72223#L289 assume ~wl_st~0 == 0; 72217#L302-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 72215#L315 assume !(eval_~tmp~0 != 0); 72214#L311 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 72116#L330 assume !(eval_~tmp___0~0 != 0); 72211#L326 assume !(~c2_st~0 == 0); 72244#L341 assume !(~wb_st~0 == 0); 72240#L356 assume !(~r_st~0 == 0); 72234#L371 [2018-11-10 03:47:24,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 1 times [2018-11-10 03:47:24,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:24,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash -999703603, now seen corresponding path program 1 times [2018-11-10 03:47:24,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:24,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1184545989, now seen corresponding path program 1 times [2018-11-10 03:47:24,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:24,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:24,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:24,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:24,376 INFO L87 Difference]: Start difference. First operand 14228 states and 21667 transitions. cyclomatic complexity: 7495 Second operand 3 states. [2018-11-10 03:47:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:24,448 INFO L93 Difference]: Finished difference Result 22535 states and 33915 transitions. [2018-11-10 03:47:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:24,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22535 states and 33915 transitions. [2018-11-10 03:47:24,519 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 9368 [2018-11-10 03:47:24,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22535 states to 22535 states and 33915 transitions. [2018-11-10 03:47:24,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9656 [2018-11-10 03:47:24,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9656 [2018-11-10 03:47:24,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22535 states and 33915 transitions. [2018-11-10 03:47:24,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:24,594 INFO L705 BuchiCegarLoop]: Abstraction has 22535 states and 33915 transitions. [2018-11-10 03:47:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22535 states and 33915 transitions. [2018-11-10 03:47:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22535 to 22535. [2018-11-10 03:47:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22535 states. [2018-11-10 03:47:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22535 states to 22535 states and 33915 transitions. [2018-11-10 03:47:24,824 INFO L728 BuchiCegarLoop]: Abstraction has 22535 states and 33915 transitions. [2018-11-10 03:47:24,824 INFO L608 BuchiCegarLoop]: Abstraction has 22535 states and 33915 transitions. [2018-11-10 03:47:24,824 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 03:47:24,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22535 states and 33915 transitions. [2018-11-10 03:47:24,880 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 9368 [2018-11-10 03:47:24,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:24,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:24,881 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-10 03:47:24,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:24,881 INFO L793 eck$LassoCheckResult]: Stem: 101532#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; 101312#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; 101270#L398 assume !(~c_req_up~0 == 1); 101272#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 101287#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 101376#L414-1 assume !(~c2_i~0 == 1);~c2_st~0 := 2; 101377#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 101594#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 101588#L429-1 assume !(~e_f~0 == 0); 101589#L434-1 assume !(~e_g~0 == 0); 101580#L439-1 assume !(~e_e~0 == 0); 101581#L444-1 assume !(~e_c~0 == 0); 101507#L449-1 assume !(~e_wl~0 == 0); 101508#L454-1 assume !(~wl_pc~0 == 1); 101449#L466 assume !(~wl_pc~0 == 2); 101450#L467 assume !(~c1_pc~0 == 1); 101587#L477 assume !(~c2_pc~0 == 1); 101586#L486 assume !(~wb_pc~0 == 1); 101563#L495 assume !(~e_c~0 == 1); 101564#L504-1 assume !(~e_e~0 == 1); 101595#L509-1 assume !(~e_f~0 == 1); 101596#L514-1 assume !(~e_g~0 == 1); 101338#L519-1 assume !(~e_c~0 == 1); 101339#L524-1 assume !(~e_wl~0 == 1); 105065#L666-1 assume true; 105066#L535 assume !false; 108512#L536 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; 115244#L371 [2018-11-10 03:47:24,881 INFO L795 eck$LassoCheckResult]: Loop: 115244#L371 assume true; 115237#L288-1 assume !false; 115230#L289 assume ~wl_st~0 == 0; 115177#L302-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 115171#L315 assume !(eval_~tmp~0 != 0); 115169#L311 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 115152#L330 assume !(eval_~tmp___0~0 != 0); 115167#L326 assume !(~c2_st~0 == 0); 115258#L341 assume !(~wb_st~0 == 0); 115252#L356 assume !(~r_st~0 == 0); 115244#L371 [2018-11-10 03:47:24,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash -27079625, now seen corresponding path program 1 times [2018-11-10 03:47:24,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:24,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:24,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:24,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:24,898 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:24,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash -999703603, now seen corresponding path program 2 times [2018-11-10 03:47:24,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:24,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:24,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:24,994 INFO L87 Difference]: Start difference. First operand 22535 states and 33915 transitions. cyclomatic complexity: 11436 Second operand 3 states. [2018-11-10 03:47:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:25,056 INFO L93 Difference]: Finished difference Result 22475 states and 33826 transitions. [2018-11-10 03:47:25,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:25,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22475 states and 33826 transitions. [2018-11-10 03:47:25,119 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 9368 [2018-11-10 03:47:25,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22475 states to 22475 states and 33826 transitions. [2018-11-10 03:47:25,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9604 [2018-11-10 03:47:25,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9604 [2018-11-10 03:47:25,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22475 states and 33826 transitions. [2018-11-10 03:47:25,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:25,189 INFO L705 BuchiCegarLoop]: Abstraction has 22475 states and 33826 transitions. [2018-11-10 03:47:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22475 states and 33826 transitions. [2018-11-10 03:47:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22475 to 22475. [2018-11-10 03:47:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22475 states. [2018-11-10 03:47:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22475 states to 22475 states and 33826 transitions. [2018-11-10 03:47:25,415 INFO L728 BuchiCegarLoop]: Abstraction has 22475 states and 33826 transitions. [2018-11-10 03:47:25,415 INFO L608 BuchiCegarLoop]: Abstraction has 22475 states and 33826 transitions. [2018-11-10 03:47:25,415 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 03:47:25,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22475 states and 33826 transitions. [2018-11-10 03:47:25,446 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 9368 [2018-11-10 03:47:25,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:25,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:25,447 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-10 03:47:25,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:25,447 INFO L793 eck$LassoCheckResult]: Stem: 146555#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; 146334#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; 146286#L398 assume !(~c_req_up~0 == 1); 146288#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 146620#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 146395#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 146396#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 146533#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 146534#L429-1 assume !(~e_f~0 == 0); 146603#L434-1 assume !(~e_g~0 == 0); 146604#L439-1 assume !(~e_e~0 == 0); 146474#L444-1 assume !(~e_c~0 == 0); 146475#L449-1 assume !(~e_wl~0 == 0); 146562#L454-1 assume !(~wl_pc~0 == 1); 146528#L466 assume !(~wl_pc~0 == 2); 146601#L467 assume !(~c1_pc~0 == 1); 146600#L477 assume !(~c2_pc~0 == 1); 146352#L486 assume !(~wb_pc~0 == 1); 146353#L495 assume !(~e_c~0 == 1); 146523#L504-1 assume !(~e_e~0 == 1); 146524#L509-1 assume !(~e_f~0 == 1); 146559#L514-1 assume !(~e_g~0 == 1); 146355#L519-1 assume !(~e_c~0 == 1); 146356#L524-1 assume !(~e_wl~0 == 1); 146449#L666-1 assume true; 150785#L535 assume !false; 152227#L536 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; 160049#L371 [2018-11-10 03:47:25,447 INFO L795 eck$LassoCheckResult]: Loop: 160049#L371 assume true; 160044#L288-1 assume !false; 160038#L289 assume ~wl_st~0 == 0; 160031#L302-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 160029#L315 assume !(eval_~tmp~0 != 0); 160020#L311 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 159980#L330 assume !(eval_~tmp___0~0 != 0); 160012#L326 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 160036#L345 assume !(eval_~tmp___1~0 != 0); 160069#L341 assume !(~wb_st~0 == 0); 160058#L356 assume !(~r_st~0 == 0); 160049#L371 [2018-11-10 03:47:25,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 2 times [2018-11-10 03:47:25,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:25,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:25,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:25,456 INFO L82 PathProgramCache]: Analyzing trace with hash -927722115, now seen corresponding path program 1 times [2018-11-10 03:47:25,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:25,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1935461499, now seen corresponding path program 1 times [2018-11-10 03:47:25,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:25,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:25,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:25,508 INFO L87 Difference]: Start difference. First operand 22475 states and 33826 transitions. cyclomatic complexity: 11407 Second operand 3 states. [2018-11-10 03:47:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:25,600 INFO L93 Difference]: Finished difference Result 38550 states and 57642 transitions. [2018-11-10 03:47:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:25,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38550 states and 57642 transitions. [2018-11-10 03:47:25,674 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 16042 [2018-11-10 03:47:25,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38550 states to 38550 states and 57642 transitions. [2018-11-10 03:47:25,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16450 [2018-11-10 03:47:25,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16450 [2018-11-10 03:47:25,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38550 states and 57642 transitions. [2018-11-10 03:47:25,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:25,749 INFO L705 BuchiCegarLoop]: Abstraction has 38550 states and 57642 transitions. [2018-11-10 03:47:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38550 states and 57642 transitions. [2018-11-10 03:47:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38550 to 38550. [2018-11-10 03:47:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38550 states. [2018-11-10 03:47:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38550 states to 38550 states and 57642 transitions. [2018-11-10 03:47:25,975 INFO L728 BuchiCegarLoop]: Abstraction has 38550 states and 57642 transitions. [2018-11-10 03:47:25,975 INFO L608 BuchiCegarLoop]: Abstraction has 38550 states and 57642 transitions. [2018-11-10 03:47:25,975 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 03:47:25,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38550 states and 57642 transitions. [2018-11-10 03:47:26,025 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 16042 [2018-11-10 03:47:26,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:26,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:26,026 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-10 03:47:26,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:26,026 INFO L793 eck$LassoCheckResult]: Stem: 207578#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; 207367#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; 207319#L398 assume !(~c_req_up~0 == 1); 207321#L398-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 207650#L409-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 207425#L414-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 207426#L419-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 207557#L424-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 207558#L429-1 assume !(~e_f~0 == 0); 207634#L434-1 assume !(~e_g~0 == 0); 207635#L439-1 assume !(~e_e~0 == 0); 207503#L444-1 assume !(~e_c~0 == 0); 207504#L449-1 assume !(~e_wl~0 == 0); 207584#L454-1 assume !(~wl_pc~0 == 1); 207552#L466 assume !(~wl_pc~0 == 2); 207631#L467 assume !(~c1_pc~0 == 1); 207630#L477 assume !(~c2_pc~0 == 1); 207383#L486 assume !(~wb_pc~0 == 1); 207384#L495 assume !(~e_c~0 == 1); 207547#L504-1 assume !(~e_e~0 == 1); 207548#L509-1 assume !(~e_f~0 == 1); 207581#L514-1 assume !(~e_g~0 == 1); 207386#L519-1 assume !(~e_c~0 == 1); 207387#L524-1 assume !(~e_wl~0 == 1); 207478#L666-1 assume true; 213343#L535 assume !false; 213344#L536 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; 215618#L371 [2018-11-10 03:47:26,026 INFO L795 eck$LassoCheckResult]: Loop: 215618#L371 assume true; 215617#L288-1 assume !false; 215614#L289 assume ~wl_st~0 == 0; 215612#L302-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 215603#L315 assume !(eval_~tmp~0 != 0); 215598#L311 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 215557#L330 assume !(eval_~tmp___0~0 != 0); 215550#L326 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 215546#L345 assume !(eval_~tmp___1~0 != 0); 215532#L341 assume ~wb_st~0 == 0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 215471#L360 assume !(eval_~tmp___2~0 != 0); 215530#L356 assume !(~r_st~0 == 0); 215618#L371 [2018-11-10 03:47:26,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 3 times [2018-11-10 03:47:26,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:26,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1305349152, now seen corresponding path program 1 times [2018-11-10 03:47:26,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 130199320, now seen corresponding path program 1 times [2018-11-10 03:47:26,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:26,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:26,439 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-11-10 03:47:26,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:47:26 BoogieIcfgContainer [2018-11-10 03:47:26,490 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:47:26,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:47:26,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:47:26,491 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:47:26,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:18" (3/4) ... [2018-11-10 03:47:26,494 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 03:47:26,537 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bc96c716-9a95-4675-93d7-ffbf2c81eb65/bin-2019/uautomizer/witness.graphml [2018-11-10 03:47:26,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:47:26,538 INFO L168 Benchmark]: Toolchain (without parser) took 8493.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 496.5 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -345.3 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,539 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:47:26,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.96 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,539 INFO L168 Benchmark]: Boogie Preprocessor took 65.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -211.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,540 INFO L168 Benchmark]: RCFGBuilder took 436.83 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,540 INFO L168 Benchmark]: BuchiAutomizer took 7701.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.4 MB). Peak memory consumption was 700.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:26,540 INFO L168 Benchmark]: Witness Printer took 47.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:47:26,542 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.96 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -211.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.83 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7701.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.4 MB). Peak memory consumption was 700.5 MB. Max. memory is 11.5 GB. * Witness Printer took 47.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (15 trivial, 3 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 -1 * e_wl + 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 38550 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 12. Automata minimization 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 853 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 38550 states and ocurred in iteration 15. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 4725 SDtfs, 4273 SDslu, 2628 SDs, 0 SdLazy, 397 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT1 SILN1 SILU0 SILI7 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital83 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp54 tf110 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 288]: 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@f731fe0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@855350c=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@341f00f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15c3aa16=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@91fce05=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: 288]: 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 ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L704] CALL start_simulation() [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L539] CALL eval() [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; Loop: [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...