./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/toy1_false-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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:32:36,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:32:36,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:32:36,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:32:36,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:32:36,060 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:32:36,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:32:36,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:32:36,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:32:36,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:32:36,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:32:36,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:32:36,063 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:32:36,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:32:36,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:32:36,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:32:36,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:32:36,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:32:36,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:32:36,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:32:36,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:32:36,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:32:36,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:32:36,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:32:36,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:32:36,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:32:36,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:32:36,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:32:36,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:32:36,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:32:36,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:32:36,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:32:36,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:32:36,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:32:36,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:32:36,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:32:36,075 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:32:36,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:32:36,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:32:36,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:32:36,086 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:32:36,086 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:32:36,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:32:36,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:32:36,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:32:36,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:32:36,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:32:36,089 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:32:36,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:32:36,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:32:36,089 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:32:36,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:32:36,090 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2018-11-10 04:32:36,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:32:36,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:32:36,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:32:36,125 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:32:36,125 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:32:36,126 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2018-11-10 04:32:36,165 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/data/45db49067/01822bba37a94734bfa22150480d4440/FLAG4ae53fdd9 [2018-11-10 04:32:36,578 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:32:36,579 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2018-11-10 04:32:36,587 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/data/45db49067/01822bba37a94734bfa22150480d4440/FLAG4ae53fdd9 [2018-11-10 04:32:36,598 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/data/45db49067/01822bba37a94734bfa22150480d4440 [2018-11-10 04:32:36,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:32:36,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:32:36,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:32:36,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:32:36,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:32:36,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36, skipping insertion in model container [2018-11-10 04:32:36,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:32:36,637 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:32:36,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:32:36,777 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:32:36,803 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:32:36,812 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:32:36,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36 WrapperNode [2018-11-10 04:32:36,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:32:36,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:32:36,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:32:36,813 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:32:36,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:32:36,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:32:36,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:32:36,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:32:36,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... [2018-11-10 04:32:36,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:32:36,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:32:36,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:32:36,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:32:36,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:32:36,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:32:37,330 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:32:37,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:37 BoogieIcfgContainer [2018-11-10 04:32:37,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:32:37,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:32:37,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:32:37,333 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:32:37,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:32:37,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:32:36" (1/3) ... [2018-11-10 04:32:37,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13f3284f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:32:37, skipping insertion in model container [2018-11-10 04:32:37,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:32:37,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:36" (2/3) ... [2018-11-10 04:32:37,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13f3284f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:32:37, skipping insertion in model container [2018-11-10 04:32:37,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:32:37,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:37" (3/3) ... [2018-11-10 04:32:37,335 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy1_false-unreach-call_false-termination.cil.c [2018-11-10 04:32:37,378 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:32:37,379 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:32:37,379 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:32:37,379 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:32:37,379 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:32:37,379 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:32:37,379 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:32:37,379 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:32:37,379 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:32:37,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2018-11-10 04:32:37,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2018-11-10 04:32:37,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,415 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 04:32:37,415 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 04:32:37,415 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:32:37,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2018-11-10 04:32:37,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2018-11-10 04:32:37,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,420 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 04:32:37,420 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 04:32:37,425 INFO L793 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 17#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; 32#L406true assume !(~c_req_up~0 == 1); 18#L406-2true assume !(~wl_i~0 == 1);~wl_st~0 := 2; 34#L417-1true assume !(~c1_i~0 == 1);~c1_st~0 := 2; 53#L422-1true assume ~c2_i~0 == 1;~c2_st~0 := 0; 81#L427-1true assume !(~wb_i~0 == 1);~wb_st~0 := 2; 103#L432-1true assume !(~r_i~0 == 1);~r_st~0 := 2; 116#L437-1true assume !(~e_f~0 == 0); 3#L442-1true assume !(~e_g~0 == 0); 36#L447-1true assume !(~e_e~0 == 0); 57#L452-1true assume !(~e_c~0 == 0); 86#L457-1true assume !(~e_wl~0 == 0); 107#L462-1true assume !(~wl_pc~0 == 1); 76#L474true assume !(~wl_pc~0 == 2); 24#L475true assume !(~c1_pc~0 == 1); 72#L485true assume !(~c2_pc~0 == 1); 27#L494true assume !(~wb_pc~0 == 1); 130#L503true assume !(~e_c~0 == 1); 99#L512-1true assume !(~e_e~0 == 1); 104#L517-1true assume !(~e_f~0 == 1); 134#L522-1true assume !(~e_g~0 == 1); 28#L527-1true assume !(~e_c~0 == 1); 50#L532-1true assume !(~e_wl~0 == 1); 111#L674-1true [2018-11-10 04:32:37,425 INFO L795 eck$LassoCheckResult]: Loop: 111#L674-1true assume true; 66#L543true assume !false; 12#L544true 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; 138#L379true assume !true; 33#L395true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 123#L550true assume !(~c_req_up~0 == 1); 105#L550-2true start_simulation_~kernel_st~0 := 3; 69#L562true assume ~e_f~0 == 0;~e_f~0 := 1; 71#L562-2true assume !(~e_g~0 == 0); 96#L567-1true assume ~e_e~0 == 0;~e_e~0 := 1; 125#L572-1true assume ~e_c~0 == 0;~e_c~0 := 1; 13#L577-1true assume ~e_wl~0 == 0;~e_wl~0 := 1; 45#L582-1true assume !(~wl_pc~0 == 1); 121#L594true assume !(~wl_pc~0 == 2); 68#L595true assume !(~c1_pc~0 == 1); 118#L605true assume !(~c2_pc~0 == 1); 89#L614true assume !(~wb_pc~0 == 1); 55#L623true assume ~e_c~0 == 1;~r_st~0 := 0; 7#L632-1true assume ~e_e~0 == 1;~e_e~0 := 2; 42#L637-1true assume !(~e_f~0 == 1); 64#L642-1true assume ~e_g~0 == 1;~e_g~0 := 2; 90#L647-1true assume ~e_c~0 == 1;~e_c~0 := 2; 113#L652-1true assume ~e_wl~0 == 1;~e_wl~0 := 2; 141#L657-1true assume ~wl_st~0 == 0; 111#L674-1true [2018-11-10 04:32:37,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-10 04:32:37,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,536 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 04:32:37,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,540 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:37,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1420425311, now seen corresponding path program 1 times [2018-11-10 04:32:37,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,547 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 04:32:37,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:32:37,549 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:32:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:32:37,560 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 2 states. [2018-11-10 04:32:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:37,572 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2018-11-10 04:32:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:32:37,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 232 transitions. [2018-11-10 04:32:37,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 132 states and 226 transitions. [2018-11-10 04:32:37,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 04:32:37,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-10 04:32:37,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 226 transitions. [2018-11-10 04:32:37,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:32:37,584 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 226 transitions. [2018-11-10 04:32:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 226 transitions. [2018-11-10 04:32:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 04:32:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 04:32:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 226 transitions. [2018-11-10 04:32:37,608 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 226 transitions. [2018-11-10 04:32:37,608 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 226 transitions. [2018-11-10 04:32:37,608 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:32:37,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 226 transitions. [2018-11-10 04:32:37,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,611 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 04:32:37,611 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 04:32:37,612 INFO L793 eck$LassoCheckResult]: Stem: 410#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; 321#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; 322#L406 assume !(~c_req_up~0 == 1); 323#L406-2 assume !(~wl_i~0 == 1);~wl_st~0 := 2; 324#L417-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 349#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 373#L427-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 399#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 411#L437-1 assume !(~e_f~0 == 0); 290#L442-1 assume !(~e_g~0 == 0); 291#L447-1 assume !(~e_e~0 == 0); 352#L452-1 assume !(~e_c~0 == 0); 378#L457-1 assume !(~e_wl~0 == 0); 402#L462-1 assume !(~wl_pc~0 == 1); 396#L474 assume !(~wl_pc~0 == 2); 332#L475 assume !(~c1_pc~0 == 1); 328#L485 assume !(~c2_pc~0 == 1); 338#L494 assume !(~wb_pc~0 == 1); 339#L503 assume !(~e_c~0 == 1); 408#L512-1 assume !(~e_e~0 == 1); 409#L517-1 assume !(~e_f~0 == 1); 412#L522-1 assume !(~e_g~0 == 1); 341#L527-1 assume !(~e_c~0 == 1); 342#L532-1 assume !(~e_wl~0 == 1); 288#L674-1 [2018-11-10 04:32:37,612 INFO L795 eck$LassoCheckResult]: Loop: 288#L674-1 assume true; 385#L543 assume !false; 311#L544 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; 312#L379 assume true; 301#L296-1 assume !false; 302#L297 assume !(~wl_st~0 == 0); 372#L301 assume !(~c1_st~0 == 0); 364#L304 assume !(~c2_st~0 == 0); 325#L307 assume !(~wb_st~0 == 0); 306#L310 assume !(~r_st~0 == 0); 308#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 348#L550 assume !(~c_req_up~0 == 1); 395#L550-2 start_simulation_~kernel_st~0 := 3; 388#L562 assume ~e_f~0 == 0;~e_f~0 := 1; 389#L562-2 assume !(~e_g~0 == 0); 392#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 407#L572-1 assume ~e_c~0 == 0;~e_c~0 := 1; 309#L577-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 310#L582-1 assume ~wl_pc~0 == 1; 298#L588 assume ~e_wl~0 == 1;~wl_st~0 := 0; 299#L595 assume !(~c1_pc~0 == 1); 387#L605 assume !(~c2_pc~0 == 1); 359#L614 assume !(~wb_pc~0 == 1); 376#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 296#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 297#L637-1 assume !(~e_f~0 == 1); 361#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 383#L647-1 assume ~e_c~0 == 1;~e_c~0 := 2; 404#L652-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 415#L657-1 assume ~wl_st~0 == 0; 288#L674-1 [2018-11-10 04:32:37,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-10 04:32:37,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,641 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 04:32:37,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,642 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:37,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash -47261605, now seen corresponding path program 1 times [2018-11-10 04:32:37,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,671 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 04:32:37,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,671 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:37,671 INFO L87 Difference]: Start difference. First operand 132 states and 226 transitions. cyclomatic complexity: 95 Second operand 3 states. [2018-11-10 04:32:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:37,683 INFO L93 Difference]: Finished difference Result 132 states and 225 transitions. [2018-11-10 04:32:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:37,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 225 transitions. [2018-11-10 04:32:37,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 225 transitions. [2018-11-10 04:32:37,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 04:32:37,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-10 04:32:37,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 225 transitions. [2018-11-10 04:32:37,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:32:37,687 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 225 transitions. [2018-11-10 04:32:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 225 transitions. [2018-11-10 04:32:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 04:32:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 04:32:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 225 transitions. [2018-11-10 04:32:37,692 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 225 transitions. [2018-11-10 04:32:37,692 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 225 transitions. [2018-11-10 04:32:37,692 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:32:37,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 225 transitions. [2018-11-10 04:32:37,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,694 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 04:32:37,694 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 04:32:37,695 INFO L793 eck$LassoCheckResult]: Stem: 681#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; 592#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; 593#L406 assume !(~c_req_up~0 == 1); 594#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 595#L417-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 620#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 646#L427-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 670#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 682#L437-1 assume !(~e_f~0 == 0); 561#L442-1 assume !(~e_g~0 == 0); 562#L447-1 assume !(~e_e~0 == 0); 623#L452-1 assume !(~e_c~0 == 0); 649#L457-1 assume !(~e_wl~0 == 0); 673#L462-1 assume !(~wl_pc~0 == 1); 667#L474 assume !(~wl_pc~0 == 2); 603#L475 assume !(~c1_pc~0 == 1); 599#L485 assume !(~c2_pc~0 == 1); 609#L494 assume !(~wb_pc~0 == 1); 610#L503 assume !(~e_c~0 == 1); 679#L512-1 assume !(~e_e~0 == 1); 680#L517-1 assume !(~e_f~0 == 1); 683#L522-1 assume !(~e_g~0 == 1); 612#L527-1 assume !(~e_c~0 == 1); 613#L532-1 assume !(~e_wl~0 == 1); 559#L674-1 [2018-11-10 04:32:37,695 INFO L795 eck$LassoCheckResult]: Loop: 559#L674-1 assume true; 656#L543 assume !false; 582#L544 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; 583#L379 assume true; 572#L296-1 assume !false; 573#L297 assume !(~wl_st~0 == 0); 643#L301 assume !(~c1_st~0 == 0); 635#L304 assume !(~c2_st~0 == 0); 596#L307 assume !(~wb_st~0 == 0); 577#L310 assume !(~r_st~0 == 0); 579#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 619#L550 assume !(~c_req_up~0 == 1); 664#L550-2 start_simulation_~kernel_st~0 := 3; 659#L562 assume ~e_f~0 == 0;~e_f~0 := 1; 660#L562-2 assume !(~e_g~0 == 0); 663#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 678#L572-1 assume ~e_c~0 == 0;~e_c~0 := 1; 580#L577-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 581#L582-1 assume ~wl_pc~0 == 1; 569#L588 assume ~e_wl~0 == 1;~wl_st~0 := 0; 570#L595 assume !(~c1_pc~0 == 1); 658#L605 assume !(~c2_pc~0 == 1); 631#L614 assume !(~wb_pc~0 == 1); 647#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 567#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 568#L637-1 assume !(~e_f~0 == 1); 632#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 654#L647-1 assume ~e_c~0 == 1;~e_c~0 := 2; 675#L652-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 686#L657-1 assume ~wl_st~0 == 0; 559#L674-1 [2018-11-10 04:32:37,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-10 04:32:37,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,714 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 04:32:37,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,715 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:37,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -47261605, now seen corresponding path program 2 times [2018-11-10 04:32:37,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,737 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 04:32:37,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,738 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:37,738 INFO L87 Difference]: Start difference. First operand 132 states and 225 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-10 04:32:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:37,755 INFO L93 Difference]: Finished difference Result 132 states and 224 transitions. [2018-11-10 04:32:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:37,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 224 transitions. [2018-11-10 04:32:37,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 224 transitions. [2018-11-10 04:32:37,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 04:32:37,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-10 04:32:37,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 224 transitions. [2018-11-10 04:32:37,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:32:37,760 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 224 transitions. [2018-11-10 04:32:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 224 transitions. [2018-11-10 04:32:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 04:32:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 04:32:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 224 transitions. [2018-11-10 04:32:37,765 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 224 transitions. [2018-11-10 04:32:37,765 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 224 transitions. [2018-11-10 04:32:37,765 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:32:37,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 224 transitions. [2018-11-10 04:32:37,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,767 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 04:32:37,767 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 04:32:37,767 INFO L793 eck$LassoCheckResult]: Stem: 952#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; 863#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; 864#L406 assume !(~c_req_up~0 == 1); 865#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 866#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 891#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 917#L427-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 941#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 953#L437-1 assume !(~e_f~0 == 0); 832#L442-1 assume !(~e_g~0 == 0); 833#L447-1 assume !(~e_e~0 == 0); 894#L452-1 assume !(~e_c~0 == 0); 921#L457-1 assume !(~e_wl~0 == 0); 944#L462-1 assume !(~wl_pc~0 == 1); 938#L474 assume !(~wl_pc~0 == 2); 874#L475 assume !(~c1_pc~0 == 1); 870#L485 assume !(~c2_pc~0 == 1); 880#L494 assume !(~wb_pc~0 == 1); 881#L503 assume !(~e_c~0 == 1); 950#L512-1 assume !(~e_e~0 == 1); 951#L517-1 assume !(~e_f~0 == 1); 954#L522-1 assume !(~e_g~0 == 1); 883#L527-1 assume !(~e_c~0 == 1); 884#L532-1 assume !(~e_wl~0 == 1); 830#L674-1 [2018-11-10 04:32:37,768 INFO L795 eck$LassoCheckResult]: Loop: 830#L674-1 assume true; 927#L543 assume !false; 853#L544 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; 854#L379 assume true; 846#L296-1 assume !false; 847#L297 assume !(~wl_st~0 == 0); 914#L301 assume !(~c1_st~0 == 0); 906#L304 assume !(~c2_st~0 == 0); 867#L307 assume !(~wb_st~0 == 0); 848#L310 assume !(~r_st~0 == 0); 850#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 890#L550 assume !(~c_req_up~0 == 1); 936#L550-2 start_simulation_~kernel_st~0 := 3; 930#L562 assume ~e_f~0 == 0;~e_f~0 := 1; 931#L562-2 assume !(~e_g~0 == 0); 934#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 949#L572-1 assume ~e_c~0 == 0;~e_c~0 := 1; 851#L577-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 852#L582-1 assume ~wl_pc~0 == 1; 843#L588 assume ~e_wl~0 == 1;~wl_st~0 := 0; 844#L595 assume !(~c1_pc~0 == 1); 929#L605 assume !(~c2_pc~0 == 1); 902#L614 assume !(~wb_pc~0 == 1); 918#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 838#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 839#L637-1 assume !(~e_f~0 == 1); 903#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 925#L647-1 assume ~e_c~0 == 1;~e_c~0 := 2; 946#L652-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 957#L657-1 assume ~wl_st~0 == 0; 830#L674-1 [2018-11-10 04:32:37,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-10 04:32:37,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,791 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 04:32:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,792 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:37,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -47261605, now seen corresponding path program 3 times [2018-11-10 04:32:37,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,815 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 04:32:37,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,816 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:37,816 INFO L87 Difference]: Start difference. First operand 132 states and 224 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-10 04:32:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:37,833 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2018-11-10 04:32:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:37,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 223 transitions. [2018-11-10 04:32:37,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 223 transitions. [2018-11-10 04:32:37,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 04:32:37,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-10 04:32:37,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 223 transitions. [2018-11-10 04:32:37,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:32:37,836 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 223 transitions. [2018-11-10 04:32:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 223 transitions. [2018-11-10 04:32:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 04:32:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 04:32:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 223 transitions. [2018-11-10 04:32:37,840 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 223 transitions. [2018-11-10 04:32:37,840 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 223 transitions. [2018-11-10 04:32:37,841 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:32:37,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 223 transitions. [2018-11-10 04:32:37,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 04:32:37,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,842 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 04:32:37,842 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 04:32:37,842 INFO L793 eck$LassoCheckResult]: Stem: 1223#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; 1134#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; 1135#L406 assume !(~c_req_up~0 == 1); 1136#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1137#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1162#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1188#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1212#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1224#L437-1 assume !(~e_f~0 == 0); 1103#L442-1 assume !(~e_g~0 == 0); 1104#L447-1 assume !(~e_e~0 == 0); 1165#L452-1 assume !(~e_c~0 == 0); 1192#L457-1 assume !(~e_wl~0 == 0); 1215#L462-1 assume !(~wl_pc~0 == 1); 1209#L474 assume !(~wl_pc~0 == 2); 1145#L475 assume !(~c1_pc~0 == 1); 1144#L485 assume !(~c2_pc~0 == 1); 1151#L494 assume !(~wb_pc~0 == 1); 1152#L503 assume !(~e_c~0 == 1); 1221#L512-1 assume !(~e_e~0 == 1); 1222#L517-1 assume !(~e_f~0 == 1); 1225#L522-1 assume !(~e_g~0 == 1); 1154#L527-1 assume !(~e_c~0 == 1); 1155#L532-1 assume !(~e_wl~0 == 1); 1101#L674-1 [2018-11-10 04:32:37,842 INFO L795 eck$LassoCheckResult]: Loop: 1101#L674-1 assume true; 1198#L543 assume !false; 1124#L544 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; 1125#L379 assume true; 1117#L296-1 assume !false; 1118#L297 assume !(~wl_st~0 == 0); 1185#L301 assume !(~c1_st~0 == 0); 1177#L304 assume !(~c2_st~0 == 0); 1138#L307 assume !(~wb_st~0 == 0); 1119#L310 assume !(~r_st~0 == 0); 1121#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1161#L550 assume !(~c_req_up~0 == 1); 1207#L550-2 start_simulation_~kernel_st~0 := 3; 1201#L562 assume ~e_f~0 == 0;~e_f~0 := 1; 1202#L562-2 assume !(~e_g~0 == 0); 1205#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1220#L572-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1122#L577-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1123#L582-1 assume ~wl_pc~0 == 1; 1114#L588 assume ~e_wl~0 == 1;~wl_st~0 := 0; 1115#L595 assume !(~c1_pc~0 == 1); 1200#L605 assume !(~c2_pc~0 == 1); 1173#L614 assume !(~wb_pc~0 == 1); 1189#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 1109#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1110#L637-1 assume !(~e_f~0 == 1); 1174#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1196#L647-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1217#L652-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1228#L657-1 assume ~wl_st~0 == 0; 1101#L674-1 [2018-11-10 04:32:37,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-10 04:32:37,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:37,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash -47261605, now seen corresponding path program 4 times [2018-11-10 04:32:37,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:37,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:37,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 04:32:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:37,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:37,898 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:37,898 INFO L87 Difference]: Start difference. First operand 132 states and 223 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-10 04:32:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:37,948 INFO L93 Difference]: Finished difference Result 166 states and 283 transitions. [2018-11-10 04:32:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:37,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 283 transitions. [2018-11-10 04:32:37,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-11-10 04:32:37,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 283 transitions. [2018-11-10 04:32:37,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2018-11-10 04:32:37,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-11-10 04:32:37,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 283 transitions. [2018-11-10 04:32:37,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:32:37,951 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 283 transitions. [2018-11-10 04:32:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 283 transitions. [2018-11-10 04:32:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-11-10 04:32:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 04:32:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 283 transitions. [2018-11-10 04:32:37,956 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 283 transitions. [2018-11-10 04:32:37,956 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 283 transitions. [2018-11-10 04:32:37,956 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:32:37,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 283 transitions. [2018-11-10 04:32:37,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-11-10 04:32:37,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:37,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:37,960 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 04:32:37,960 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 04:32:37,960 INFO L793 eck$LassoCheckResult]: Stem: 1528#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; 1438#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; 1439#L406 assume !(~c_req_up~0 == 1); 1440#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1441#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1466#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1492#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1517#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1529#L437-1 assume ~e_f~0 == 0;~e_f~0 := 1; 1407#L442-1 assume !(~e_g~0 == 0); 1408#L447-1 assume !(~e_e~0 == 0); 1469#L452-1 assume !(~e_c~0 == 0); 1496#L457-1 assume !(~e_wl~0 == 0); 1520#L462-1 assume !(~wl_pc~0 == 1); 1514#L474 assume !(~wl_pc~0 == 2); 1449#L475 assume !(~c1_pc~0 == 1); 1448#L485 assume !(~c2_pc~0 == 1); 1457#L494 assume !(~wb_pc~0 == 1); 1458#L503 assume !(~e_c~0 == 1); 1526#L512-1 assume !(~e_e~0 == 1); 1527#L517-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1530#L522-1 assume !(~e_g~0 == 1); 1455#L527-1 assume !(~e_c~0 == 1); 1456#L532-1 assume !(~e_wl~0 == 1); 1405#L674-1 [2018-11-10 04:32:37,961 INFO L795 eck$LassoCheckResult]: Loop: 1405#L674-1 assume true; 1502#L543 assume !false; 1426#L544 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; 1427#L379 assume true; 1415#L296-1 assume !false; 1416#L297 assume !(~wl_st~0 == 0); 1489#L301 assume !(~c1_st~0 == 0); 1481#L304 assume !(~c2_st~0 == 0); 1442#L307 assume !(~wb_st~0 == 0); 1423#L310 assume !(~r_st~0 == 0); 1425#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1465#L550 assume !(~c_req_up~0 == 1); 1512#L550-2 start_simulation_~kernel_st~0 := 3; 1505#L562 assume ~e_f~0 == 0;~e_f~0 := 1; 1506#L562-2 assume !(~e_g~0 == 0); 1510#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1525#L572-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1428#L577-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1429#L582-1 assume ~wl_pc~0 == 1; 1420#L588 assume ~e_wl~0 == 1;~wl_st~0 := 0; 1421#L595 assume !(~c1_pc~0 == 1); 1504#L605 assume !(~c2_pc~0 == 1); 1477#L614 assume !(~wb_pc~0 == 1); 1493#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 1413#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1414#L637-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1478#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1501#L647-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1522#L652-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1533#L657-1 assume ~wl_st~0 == 0; 1405#L674-1 [2018-11-10 04:32:37,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2018-11-10 04:32:37,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:38,015 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 04:32:38,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:38,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:38,016 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:38,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -49108647, now seen corresponding path program 1 times [2018-11-10 04:32:38,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:38,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:38,155 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 04:32:38,207 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:32:38,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:32:38,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:32:38,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:32:38,208 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:32:38,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:32:38,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:32:38,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:32:38,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 04:32:38,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:32:38,209 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:32:38,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 04:32:38,227 INFO 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 04:32:38,239 INFO 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 04:32:38,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 04:32:38,242 INFO 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 04:32:38,244 INFO 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 04:32:38,248 INFO 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 04:32:38,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:38,251 INFO 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 04:32:38,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 04:32:38,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 04:32:38,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 04:32:38,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 04:32:38,260 INFO 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 04:32:38,263 INFO 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 04:32:38,268 INFO 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 04:32:38,271 INFO 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 04:32:38,276 INFO 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 04:32:38,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:38,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:38,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 04:32:38,288 INFO 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 04:32:38,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 04:32:38,293 INFO 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 04:32:38,301 INFO 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 04:32:38,306 INFO 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 04:32:38,459 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:32:38,460 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:38,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:38,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:38,468 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:38,468 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:38,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:38,486 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:38,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:32:38,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:38,521 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:32:38,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:32:38,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:32:38,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:32:38,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:32:38,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:32:38,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:32:38,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:32:38,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:32:38,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 04:32:38,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:32:38,537 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:32:38,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:38,543 INFO 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 04:32:38,556 INFO 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 04:32:38,558 INFO 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 04:32:38,563 INFO 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 04:32:38,564 INFO 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 04:32:38,571 INFO 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 04:32:38,572 INFO 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 04:32:38,574 INFO 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 04:32:38,575 INFO 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 04:32:38,576 INFO 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 04:32:38,595 INFO 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 04:32:38,596 INFO 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 04:32:38,597 INFO 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 04:32:38,599 INFO 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 04:32:38,602 INFO 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 04:32:38,604 INFO 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 04:32:38,608 INFO 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 04:32:38,609 INFO 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 04:32:38,611 INFO 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 04:32:38,614 INFO 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 04:32:38,616 INFO 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 04:32:38,629 INFO 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 04:32:38,631 INFO 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 04:32:38,634 INFO 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 04:32:38,636 INFO 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 04:32:38,779 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:32:38,783 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:32:38,785 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 04:32:38,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:38,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:38,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:38,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:32:38,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:38,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:32:38,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:38,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:38,792 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 04:32:38,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:38,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:38,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:38,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:38,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:38,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:38,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:38,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:32:38,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:32:38,798 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:32:38,800 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:32:38,800 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:32:38,800 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:32:38,800 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-10 04:32:38,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:32:38,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:38,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:38,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:38,895 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 04:32:38,899 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 04:32:38,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 283 transitions. cyclomatic complexity: 118 Second operand 5 states. [2018-11-10 04:32:38,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 283 transitions. cyclomatic complexity: 118. Second operand 5 states. Result 528 states and 888 transitions. Complement of second has 5 states. [2018-11-10 04:32:38,974 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 04:32:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:32:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2018-11-10 04:32:38,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 390 transitions. Stem has 24 letters. Loop has 30 letters. [2018-11-10 04:32:38,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:38,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 390 transitions. Stem has 54 letters. Loop has 30 letters. [2018-11-10 04:32:38,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:38,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 390 transitions. Stem has 24 letters. Loop has 60 letters. [2018-11-10 04:32:38,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:38,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 528 states and 888 transitions. [2018-11-10 04:32:38,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 354 [2018-11-10 04:32:38,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 528 states to 528 states and 888 transitions. [2018-11-10 04:32:38,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2018-11-10 04:32:38,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2018-11-10 04:32:38,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 888 transitions. [2018-11-10 04:32:38,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:38,995 INFO L705 BuchiCegarLoop]: Abstraction has 528 states and 888 transitions. [2018-11-10 04:32:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 888 transitions. [2018-11-10 04:32:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 406. [2018-11-10 04:32:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-11-10 04:32:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 685 transitions. [2018-11-10 04:32:39,011 INFO L728 BuchiCegarLoop]: Abstraction has 406 states and 685 transitions. [2018-11-10 04:32:39,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:39,011 INFO L87 Difference]: Start difference. First operand 406 states and 685 transitions. Second operand 3 states. [2018-11-10 04:32:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:39,080 INFO L93 Difference]: Finished difference Result 676 states and 1095 transitions. [2018-11-10 04:32:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:39,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 1095 transitions. [2018-11-10 04:32:39,085 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 404 [2018-11-10 04:32:39,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 676 states and 1095 transitions. [2018-11-10 04:32:39,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2018-11-10 04:32:39,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2018-11-10 04:32:39,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 676 states and 1095 transitions. [2018-11-10 04:32:39,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:39,090 INFO L705 BuchiCegarLoop]: Abstraction has 676 states and 1095 transitions. [2018-11-10 04:32:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states and 1095 transitions. [2018-11-10 04:32:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 643. [2018-11-10 04:32:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-11-10 04:32:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1050 transitions. [2018-11-10 04:32:39,101 INFO L728 BuchiCegarLoop]: Abstraction has 643 states and 1050 transitions. [2018-11-10 04:32:39,101 INFO L608 BuchiCegarLoop]: Abstraction has 643 states and 1050 transitions. [2018-11-10 04:32:39,101 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:32:39,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 643 states and 1050 transitions. [2018-11-10 04:32:39,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 404 [2018-11-10 04:32:39,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:39,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:39,105 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 04:32:39,105 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 04:32:39,105 INFO L793 eck$LassoCheckResult]: Stem: 3621#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; 3430#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; 3431#L406 assume !(~c_req_up~0 == 1); 3432#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 3433#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 3476#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 3538#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 3591#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 3622#L437-1 assume !(~e_f~0 == 0); 3369#L442-1 assume !(~e_g~0 == 0); 3370#L447-1 assume !(~e_e~0 == 0); 3481#L452-1 assume !(~e_c~0 == 0); 3546#L457-1 assume !(~e_wl~0 == 0); 3598#L462-1 assume !(~wl_pc~0 == 1); 3585#L474 assume !(~wl_pc~0 == 2); 3447#L475 assume !(~c1_pc~0 == 1); 3446#L485 assume !(~c2_pc~0 == 1); 3458#L494 assume !(~wb_pc~0 == 1); 3459#L503 assume !(~e_c~0 == 1); 3619#L512-1 assume !(~e_e~0 == 1); 3620#L517-1 assume !(~e_f~0 == 1); 3623#L522-1 assume !(~e_g~0 == 1); 3461#L527-1 assume !(~e_c~0 == 1); 3462#L532-1 assume !(~e_wl~0 == 1); 3529#L674-1 assume true; 3723#L543 [2018-11-10 04:32:39,105 INFO L795 eck$LassoCheckResult]: Loop: 3723#L543 assume !false; 3845#L544 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; 3644#L379 assume true; 3645#L296-1 assume !false; 3766#L297 assume !(~wl_st~0 == 0); 3767#L301 assume !(~c1_st~0 == 0); 3772#L304 assume !(~c2_st~0 == 0); 3773#L307 assume !(~wb_st~0 == 0); 3768#L310 assume !(~r_st~0 == 0); 3769#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 3840#L550 assume !(~c_req_up~0 == 1); 3835#L550-2 start_simulation_~kernel_st~0 := 3; 3833#L562 assume !(~e_f~0 == 0); 3831#L562-2 assume !(~e_g~0 == 0); 3829#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 3827#L572-1 assume !(~e_c~0 == 0); 3825#L577-1 assume !(~e_wl~0 == 0); 3823#L582-1 assume !(~wl_pc~0 == 1); 3819#L594 assume !(~wl_pc~0 == 2); 3815#L595 assume !(~c1_pc~0 == 1); 3811#L605 assume !(~c2_pc~0 == 1); 3807#L614 assume !(~wb_pc~0 == 1); 3803#L623 assume ~e_c~0 == 1;~r_st~0 := 0; 3801#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 3799#L637-1 assume !(~e_f~0 == 1); 3797#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 3795#L647-1 assume !(~e_c~0 == 1); 3791#L652-1 assume !(~e_wl~0 == 1); 3792#L657-1 assume ~wl_st~0 == 0; 3850#L674-1 assume true; 3723#L543 [2018-11-10 04:32:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 1 times [2018-11-10 04:32:39,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash -156767364, now seen corresponding path program 1 times [2018-11-10 04:32:39,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,138 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 04:32:39,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,139 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:39,139 INFO L87 Difference]: Start difference. First operand 643 states and 1050 transitions. cyclomatic complexity: 413 Second operand 3 states. [2018-11-10 04:32:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:39,165 INFO L93 Difference]: Finished difference Result 791 states and 1300 transitions. [2018-11-10 04:32:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:39,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 791 states and 1300 transitions. [2018-11-10 04:32:39,171 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 450 [2018-11-10 04:32:39,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 791 states to 748 states and 1220 transitions. [2018-11-10 04:32:39,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2018-11-10 04:32:39,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2018-11-10 04:32:39,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 748 states and 1220 transitions. [2018-11-10 04:32:39,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:39,176 INFO L705 BuchiCegarLoop]: Abstraction has 748 states and 1220 transitions. [2018-11-10 04:32:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states and 1220 transitions. [2018-11-10 04:32:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2018-11-10 04:32:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-10 04:32:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1220 transitions. [2018-11-10 04:32:39,189 INFO L728 BuchiCegarLoop]: Abstraction has 748 states and 1220 transitions. [2018-11-10 04:32:39,189 INFO L608 BuchiCegarLoop]: Abstraction has 748 states and 1220 transitions. [2018-11-10 04:32:39,190 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:32:39,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 748 states and 1220 transitions. [2018-11-10 04:32:39,193 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 450 [2018-11-10 04:32:39,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:39,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:39,194 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 04:32:39,194 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 04:32:39,194 INFO L793 eck$LassoCheckResult]: Stem: 5049#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; 4869#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; 4870#L406 assume !(~c_req_up~0 == 1); 4871#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 4872#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 4915#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 4969#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 5022#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 5050#L437-1 assume !(~e_f~0 == 0); 4809#L442-1 assume !(~e_g~0 == 0); 4810#L447-1 assume !(~e_e~0 == 0); 4920#L452-1 assume ~e_c~0 == 0;~e_c~0 := 1; 4976#L457-1 assume !(~e_wl~0 == 0); 5029#L462-1 assume !(~wl_pc~0 == 1); 5017#L474 assume !(~wl_pc~0 == 2); 4887#L475 assume !(~c1_pc~0 == 1); 4886#L485 assume !(~c2_pc~0 == 1); 4898#L494 assume !(~wb_pc~0 == 1); 4899#L503 assume ~e_c~0 == 1;~r_st~0 := 0; 5047#L512-1 assume !(~e_e~0 == 1); 5048#L517-1 assume !(~e_f~0 == 1); 5053#L522-1 assume !(~e_g~0 == 1); 4901#L527-1 assume ~e_c~0 == 1;~e_c~0 := 2; 4902#L532-1 assume !(~e_wl~0 == 1); 4962#L674-1 assume true; 5142#L543 [2018-11-10 04:32:39,194 INFO L795 eck$LassoCheckResult]: Loop: 5142#L543 assume !false; 5373#L544 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; 5077#L379 assume true; 4829#L296-1 assume !false; 4830#L297 assume !(~wl_st~0 == 0); 5045#L301 assume !(~c1_st~0 == 0); 5342#L304 assume !(~c2_st~0 == 0); 4873#L307 assume !(~wb_st~0 == 0); 4875#L310 assume !(~r_st~0 == 0); 5337#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 5067#L550 assume !(~c_req_up~0 == 1); 5068#L550-2 start_simulation_~kernel_st~0 := 3; 5466#L562 assume !(~e_f~0 == 0); 5465#L562-2 assume !(~e_g~0 == 0); 5464#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 5463#L572-1 assume !(~e_c~0 == 0); 5462#L577-1 assume !(~e_wl~0 == 0); 5461#L582-1 assume !(~wl_pc~0 == 1); 5459#L594 assume !(~wl_pc~0 == 2); 5457#L595 assume !(~c1_pc~0 == 1); 5455#L605 assume !(~c2_pc~0 == 1); 5453#L614 assume !(~wb_pc~0 == 1); 5451#L623 assume !(~e_c~0 == 1); 5449#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 5448#L637-1 assume !(~e_f~0 == 1); 5447#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 5442#L647-1 assume !(~e_c~0 == 1); 5440#L652-1 assume !(~e_wl~0 == 1); 5384#L657-1 assume ~wl_st~0 == 0; 5379#L674-1 assume true; 5142#L543 [2018-11-10 04:32:39,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1430069003, now seen corresponding path program 1 times [2018-11-10 04:32:39,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,212 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 04:32:39,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:39,212 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:39,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -966113990, now seen corresponding path program 1 times [2018-11-10 04:32:39,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,224 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 04:32:39,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,225 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:39,225 INFO L87 Difference]: Start difference. First operand 748 states and 1220 transitions. cyclomatic complexity: 478 Second operand 4 states. [2018-11-10 04:32:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:39,320 INFO L93 Difference]: Finished difference Result 1143 states and 1837 transitions. [2018-11-10 04:32:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:32:39,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1143 states and 1837 transitions. [2018-11-10 04:32:39,326 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 638 [2018-11-10 04:32:39,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1143 states to 1143 states and 1837 transitions. [2018-11-10 04:32:39,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 732 [2018-11-10 04:32:39,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 732 [2018-11-10 04:32:39,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1143 states and 1837 transitions. [2018-11-10 04:32:39,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:39,333 INFO L705 BuchiCegarLoop]: Abstraction has 1143 states and 1837 transitions. [2018-11-10 04:32:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states and 1837 transitions. [2018-11-10 04:32:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1101. [2018-11-10 04:32:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2018-11-10 04:32:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1776 transitions. [2018-11-10 04:32:39,351 INFO L728 BuchiCegarLoop]: Abstraction has 1101 states and 1776 transitions. [2018-11-10 04:32:39,351 INFO L608 BuchiCegarLoop]: Abstraction has 1101 states and 1776 transitions. [2018-11-10 04:32:39,351 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:32:39,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1101 states and 1776 transitions. [2018-11-10 04:32:39,355 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 638 [2018-11-10 04:32:39,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:39,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:39,356 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 04:32:39,356 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 04:32:39,356 INFO L793 eck$LassoCheckResult]: Stem: 6968#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; 6772#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; 6773#L406 assume !(~c_req_up~0 == 1); 6774#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 6775#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 6874#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 6875#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 6970#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 6971#L437-1 assume !(~e_f~0 == 0); 6710#L442-1 assume !(~e_g~0 == 0); 6711#L447-1 assume !(~e_e~0 == 0); 6884#L452-1 assume !(~e_c~0 == 0); 6885#L457-1 assume !(~e_wl~0 == 0); 6950#L462-1 assume !(~wl_pc~0 == 1); 7278#L474 assume !(~wl_pc~0 == 2); 6788#L475 assume !(~c1_pc~0 == 1); 6787#L485 assume !(~c2_pc~0 == 1); 7235#L494 assume !(~wb_pc~0 == 1); 7233#L503 assume ~e_c~0 == 1;~r_st~0 := 0; 6966#L512-1 assume !(~e_e~0 == 1); 6967#L517-1 assume !(~e_f~0 == 1); 6973#L522-1 assume !(~e_g~0 == 1); 6802#L527-1 assume ~e_c~0 == 1;~e_c~0 := 2; 6803#L532-1 assume !(~e_wl~0 == 1); 6867#L674-1 assume true; 7211#L543 [2018-11-10 04:32:39,356 INFO L795 eck$LassoCheckResult]: Loop: 7211#L543 assume !false; 7566#L544 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; 7564#L379 assume true; 7559#L296-1 assume !false; 7560#L297 assume !(~wl_st~0 == 0); 7729#L301 assume !(~c1_st~0 == 0); 7730#L304 assume !(~c2_st~0 == 0); 7727#L307 assume !(~wb_st~0 == 0); 7728#L310 assume !(~r_st~0 == 0); 7553#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 7552#L550 assume !(~c_req_up~0 == 1); 6922#L550-2 start_simulation_~kernel_st~0 := 3; 6972#L562 assume !(~e_f~0 == 0); 7793#L562-2 assume !(~e_g~0 == 0); 7656#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 7654#L572-1 assume !(~e_c~0 == 0); 7651#L577-1 assume !(~e_wl~0 == 0); 7650#L582-1 assume !(~wl_pc~0 == 1); 7641#L594 assume !(~wl_pc~0 == 2); 7636#L595 assume !(~c1_pc~0 == 1); 7632#L605 assume !(~c2_pc~0 == 1); 7628#L614 assume !(~wb_pc~0 == 1); 7625#L623 assume !(~e_c~0 == 1); 7623#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 7621#L637-1 assume !(~e_f~0 == 1); 6895#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 6896#L647-1 assume !(~e_c~0 == 1); 6953#L652-1 assume !(~e_wl~0 == 1); 6980#L657-1 assume ~wl_st~0 == 0; 7576#L674-1 assume true; 7211#L543 [2018-11-10 04:32:39,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1853781043, now seen corresponding path program 1 times [2018-11-10 04:32:39,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,385 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 04:32:39,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,386 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:39,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash -966113990, now seen corresponding path program 2 times [2018-11-10 04:32:39,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,397 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 04:32:39,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,397 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:39,398 INFO L87 Difference]: Start difference. First operand 1101 states and 1776 transitions. cyclomatic complexity: 685 Second operand 3 states. [2018-11-10 04:32:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:39,457 INFO L93 Difference]: Finished difference Result 1345 states and 2155 transitions. [2018-11-10 04:32:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:39,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1345 states and 2155 transitions. [2018-11-10 04:32:39,463 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 755 [2018-11-10 04:32:39,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1345 states to 1345 states and 2155 transitions. [2018-11-10 04:32:39,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 836 [2018-11-10 04:32:39,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 836 [2018-11-10 04:32:39,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1345 states and 2155 transitions. [2018-11-10 04:32:39,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:39,471 INFO L705 BuchiCegarLoop]: Abstraction has 1345 states and 2155 transitions. [2018-11-10 04:32:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states and 2155 transitions. [2018-11-10 04:32:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1341. [2018-11-10 04:32:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-11-10 04:32:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2151 transitions. [2018-11-10 04:32:39,489 INFO L728 BuchiCegarLoop]: Abstraction has 1341 states and 2151 transitions. [2018-11-10 04:32:39,489 INFO L608 BuchiCegarLoop]: Abstraction has 1341 states and 2151 transitions. [2018-11-10 04:32:39,489 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 04:32:39,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1341 states and 2151 transitions. [2018-11-10 04:32:39,494 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 755 [2018-11-10 04:32:39,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:39,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:39,494 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 04:32:39,494 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 04:32:39,494 INFO L793 eck$LassoCheckResult]: Stem: 9422#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; 9224#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; 9225#L406 assume !(~c_req_up~0 == 1); 9268#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 9273#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 9274#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 9398#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 9399#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 9444#L437-1 assume !(~e_f~0 == 0); 9445#L442-1 assume !(~e_g~0 == 0); 9279#L447-1 assume !(~e_e~0 == 0); 9280#L452-1 assume !(~e_c~0 == 0); 9483#L457-1 assume !(~e_wl~0 == 0); 9482#L462-1 assume !(~wl_pc~0 == 1); 9479#L474 assume !(~wl_pc~0 == 2); 9478#L475 assume !(~c1_pc~0 == 1); 9476#L485 assume !(~c2_pc~0 == 1); 9474#L494 assume !(~wb_pc~0 == 1); 9472#L503 assume !(~e_c~0 == 1); 9471#L512-1 assume !(~e_e~0 == 1); 9470#L517-1 assume !(~e_f~0 == 1); 9469#L522-1 assume !(~e_g~0 == 1); 9256#L527-1 assume !(~e_c~0 == 1); 9257#L532-1 assume !(~e_wl~0 == 1); 9323#L674-1 assume true; 9877#L543 [2018-11-10 04:32:39,494 INFO L795 eck$LassoCheckResult]: Loop: 9877#L543 assume !false; 10161#L544 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; 10159#L379 assume true; 10154#L296-1 assume !false; 10155#L297 assume !(~wl_st~0 == 0); 10361#L301 assume !(~c1_st~0 == 0); 10362#L304 assume !(~c2_st~0 == 0); 10359#L307 assume !(~wb_st~0 == 0); 10360#L310 assume !(~r_st~0 == 0); 10145#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 10146#L550 assume !(~c_req_up~0 == 1); 10253#L550-2 start_simulation_~kernel_st~0 := 3; 10254#L562 assume !(~e_f~0 == 0); 10249#L562-2 assume !(~e_g~0 == 0); 10250#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 10245#L572-1 assume !(~e_c~0 == 0); 10246#L577-1 assume !(~e_wl~0 == 0); 10242#L582-1 assume !(~wl_pc~0 == 1); 10241#L594 assume !(~wl_pc~0 == 2); 10236#L595 assume !(~c1_pc~0 == 1); 10234#L605 assume !(~c2_pc~0 == 1); 10231#L614 assume !(~wb_pc~0 == 1); 10224#L623 assume !(~e_c~0 == 1); 10223#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 10222#L637-1 assume !(~e_f~0 == 1); 10219#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 10209#L647-1 assume !(~e_c~0 == 1); 10208#L652-1 assume !(~e_wl~0 == 1); 10195#L657-1 assume ~wl_st~0 == 0; 10192#L674-1 assume true; 9877#L543 [2018-11-10 04:32:39,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 2 times [2018-11-10 04:32:39,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -966113990, now seen corresponding path program 3 times [2018-11-10 04:32:39,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,517 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 04:32:39,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,517 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:32:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:39,518 INFO L87 Difference]: Start difference. First operand 1341 states and 2151 transitions. cyclomatic complexity: 822 Second operand 3 states. [2018-11-10 04:32:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:39,548 INFO L93 Difference]: Finished difference Result 2161 states and 3417 transitions. [2018-11-10 04:32:39,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:39,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2161 states and 3417 transitions. [2018-11-10 04:32:39,557 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1240 [2018-11-10 04:32:39,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2161 states to 2161 states and 3417 transitions. [2018-11-10 04:32:39,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1319 [2018-11-10 04:32:39,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1319 [2018-11-10 04:32:39,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2161 states and 3417 transitions. [2018-11-10 04:32:39,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:39,567 INFO L705 BuchiCegarLoop]: Abstraction has 2161 states and 3417 transitions. [2018-11-10 04:32:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states and 3417 transitions. [2018-11-10 04:32:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2018-11-10 04:32:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-11-10 04:32:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3417 transitions. [2018-11-10 04:32:39,597 INFO L728 BuchiCegarLoop]: Abstraction has 2161 states and 3417 transitions. [2018-11-10 04:32:39,597 INFO L608 BuchiCegarLoop]: Abstraction has 2161 states and 3417 transitions. [2018-11-10 04:32:39,597 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 04:32:39,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2161 states and 3417 transitions. [2018-11-10 04:32:39,604 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1240 [2018-11-10 04:32:39,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:39,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:39,605 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 04:32:39,605 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, 1] [2018-11-10 04:32:39,605 INFO L793 eck$LassoCheckResult]: Stem: 12934#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; 12727#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; 12728#L406 assume !(~c_req_up~0 == 1); 12774#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 12778#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 12779#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 12905#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 12906#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 12954#L437-1 assume !(~e_f~0 == 0); 12671#L442-1 assume !(~e_g~0 == 0); 12672#L447-1 assume !(~e_e~0 == 0); 12784#L452-1 assume !(~e_c~0 == 0); 12986#L457-1 assume !(~e_wl~0 == 0); 12985#L462-1 assume !(~wl_pc~0 == 1); 12982#L474 assume !(~wl_pc~0 == 2); 12981#L475 assume !(~c1_pc~0 == 1); 12979#L485 assume !(~c2_pc~0 == 1); 12977#L494 assume !(~wb_pc~0 == 1); 12975#L503 assume !(~e_c~0 == 1); 12974#L512-1 assume !(~e_e~0 == 1); 12973#L517-1 assume !(~e_f~0 == 1); 12972#L522-1 assume !(~e_g~0 == 1); 12762#L527-1 assume !(~e_c~0 == 1); 12763#L532-1 assume !(~e_wl~0 == 1); 13232#L674-1 assume true; 13233#L543 [2018-11-10 04:32:39,605 INFO L795 eck$LassoCheckResult]: Loop: 13233#L543 assume !false; 13856#L544 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; 13853#L379 assume true; 13851#L296-1 assume !false; 13852#L297 assume !(~wl_st~0 == 0); 14208#L301 assume !(~c1_st~0 == 0); 14204#L304 assume !(~c2_st~0 == 0); 14201#L307 assume !(~wb_st~0 == 0); 14199#L310 assume !(~r_st~0 == 0); 14197#L395 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 14195#L550 assume !(~c_req_up~0 == 1); 14196#L550-2 start_simulation_~kernel_st~0 := 3; 14341#L562 assume !(~e_f~0 == 0); 14339#L562-2 assume !(~e_g~0 == 0); 14337#L567-1 assume ~e_e~0 == 0;~e_e~0 := 1; 14336#L572-1 assume !(~e_c~0 == 0); 14335#L577-1 assume !(~e_wl~0 == 0); 14334#L582-1 assume !(~wl_pc~0 == 1); 14331#L594 assume ~wl_pc~0 == 2; 14329#L596 assume ~e_e~0 == 1;~wl_st~0 := 0; 14330#L595 assume !(~c1_pc~0 == 1); 14328#L605 assume !(~c2_pc~0 == 1); 14324#L614 assume !(~wb_pc~0 == 1); 14319#L623 assume !(~e_c~0 == 1); 14158#L632-1 assume ~e_e~0 == 1;~e_e~0 := 2; 14154#L637-1 assume !(~e_f~0 == 1); 14153#L642-1 assume ~e_g~0 == 1;~e_g~0 := 2; 13890#L647-1 assume !(~e_c~0 == 1); 13884#L652-1 assume !(~e_wl~0 == 1); 13885#L657-1 assume ~wl_st~0 == 0; 13869#L674-1 assume true; 13233#L543 [2018-11-10 04:32:39,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 3 times [2018-11-10 04:32:39,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:39,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash -633818936, now seen corresponding path program 1 times [2018-11-10 04:32:39,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:39,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash -818087982, now seen corresponding path program 1 times [2018-11-10 04:32:39,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:39,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:39,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:39,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:32:39,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:39,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:39,791 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:32:39,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:32:39,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:32:39,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:32:39,792 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:32:39,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:32:39,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:32:39,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:32:39,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration11_Loop [2018-11-10 04:32:39,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:32:39,792 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:32:39,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 04:32:39,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 04:32:39,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 04:32:39,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 04:32:39,811 INFO 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 04:32:39,815 INFO 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 04:32:39,821 INFO 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 04:32:39,828 INFO 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 04:32:39,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:39,855 INFO 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 04:32:39,857 INFO 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 04:32:39,859 INFO 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 04:32:39,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:39,875 INFO 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 04:32:39,877 INFO 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 04:32:39,880 INFO 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 04:32:39,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:39,897 INFO 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 04:32:39,899 INFO 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 04:32:39,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:39,902 INFO 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 04:32:39,904 INFO 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 04:32:39,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:39,910 INFO 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 04:32:39,918 INFO 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 04:32:39,919 INFO 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 04:32:40,258 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:32:40,258 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,274 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,274 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,301 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,302 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,328 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,328 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,361 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,361 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,368 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,368 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,386 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:32:40,386 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_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:32:40,403 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/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 04:32:40,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:32:40,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:32:40,425 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:32:40,440 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:32:40,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:32:40,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:32:40,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:32:40,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:32:40,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:32:40,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:32:40,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:32:40,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration11_Loop [2018-11-10 04:32:40,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:32:40,440 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:32:40,442 INFO 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 04:32:40,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,455 INFO 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 04:32:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,464 INFO 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 04:32:40,466 INFO 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 04:32:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,472 INFO 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 04:32:40,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,482 INFO 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 04:32:40,484 INFO 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 04:32:40,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,486 INFO 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 04:32:40,487 INFO 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 04:32:40,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:32:40,490 INFO 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 04:32:40,491 INFO 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 04:32:40,654 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:32:40,654 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:32:40,654 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 04:32:40,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:40,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:40,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,656 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 04:32:40,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:32:40,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:32:40,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,663 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 04:32:40,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,664 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:32:40,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:32:40,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,668 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 04:32:40,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:40,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:40,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,672 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 04:32:40,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,672 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:32:40,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:32:40,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,676 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 04:32:40,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:32:40,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:32:40,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,678 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 04:32:40,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:40,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:40,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,680 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 04:32:40,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:40,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:40,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:32:40,685 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 04:32:40,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:32:40,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:32:40,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:32:40,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:32:40,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:32:40,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:32:40,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:32:40,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:32:40,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:32:40,693 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:32:40,693 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:32:40,693 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:32:40,693 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:32:40,693 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_g~0) = -2*~e_g~0 + 3 Supporting invariants [] [2018-11-10 04:32:40,694 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:32:40,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:40,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:40,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:40,795 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 04:32:40,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:32:40,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2161 states and 3417 transitions. cyclomatic complexity: 1268 Second operand 4 states. [2018-11-10 04:32:40,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2161 states and 3417 transitions. cyclomatic complexity: 1268. Second operand 4 states. Result 6132 states and 9651 transitions. Complement of second has 5 states. [2018-11-10 04:32:40,849 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 04:32:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:32:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2018-11-10 04:32:40,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 31 letters. [2018-11-10 04:32:40,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:40,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 56 letters. Loop has 31 letters. [2018-11-10 04:32:40,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:40,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 62 letters. [2018-11-10 04:32:40,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:32:40,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6132 states and 9651 transitions. [2018-11-10 04:32:40,877 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2396 [2018-11-10 04:32:40,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6132 states to 6132 states and 9651 transitions. [2018-11-10 04:32:40,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2484 [2018-11-10 04:32:40,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2513 [2018-11-10 04:32:40,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6132 states and 9651 transitions. [2018-11-10 04:32:40,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:40,906 INFO L705 BuchiCegarLoop]: Abstraction has 6132 states and 9651 transitions. [2018-11-10 04:32:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states and 9651 transitions. [2018-11-10 04:32:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6103. [2018-11-10 04:32:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6103 states. [2018-11-10 04:32:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 9613 transitions. [2018-11-10 04:32:40,991 INFO L728 BuchiCegarLoop]: Abstraction has 6103 states and 9613 transitions. [2018-11-10 04:32:40,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:40,992 INFO L87 Difference]: Start difference. First operand 6103 states and 9613 transitions. Second operand 3 states. [2018-11-10 04:32:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:41,021 INFO L93 Difference]: Finished difference Result 4409 states and 6952 transitions. [2018-11-10 04:32:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:41,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4409 states and 6952 transitions. [2018-11-10 04:32:41,037 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1668 [2018-11-10 04:32:41,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4409 states to 4409 states and 6952 transitions. [2018-11-10 04:32:41,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1756 [2018-11-10 04:32:41,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1756 [2018-11-10 04:32:41,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4409 states and 6952 transitions. [2018-11-10 04:32:41,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:41,056 INFO L705 BuchiCegarLoop]: Abstraction has 4409 states and 6952 transitions. [2018-11-10 04:32:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states and 6952 transitions. [2018-11-10 04:32:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2018-11-10 04:32:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2018-11-10 04:32:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6952 transitions. [2018-11-10 04:32:41,117 INFO L728 BuchiCegarLoop]: Abstraction has 4409 states and 6952 transitions. [2018-11-10 04:32:41,117 INFO L608 BuchiCegarLoop]: Abstraction has 4409 states and 6952 transitions. [2018-11-10 04:32:41,117 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 04:32:41,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4409 states and 6952 transitions. [2018-11-10 04:32:41,128 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1668 [2018-11-10 04:32:41,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:41,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:41,129 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 04:32:41,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:41,129 INFO L793 eck$LassoCheckResult]: Stem: 31933#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; 31722#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; 31723#L406 assume !(~c_req_up~0 == 1); 31724#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 31725#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 31774#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 31834#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 31904#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 31937#L437-1 assume !(~e_f~0 == 0); 31660#L442-1 assume !(~e_g~0 == 0); 31661#L447-1 assume !(~e_e~0 == 0); 31843#L452-1 assume !(~e_c~0 == 0); 31844#L457-1 assume !(~e_wl~0 == 0); 32013#L462-1 assume !(~wl_pc~0 == 1); 31896#L474 assume !(~wl_pc~0 == 2); 31897#L475 assume !(~c1_pc~0 == 1); 31996#L485 assume !(~c2_pc~0 == 1); 31994#L494 assume !(~wb_pc~0 == 1); 31971#L503 assume !(~e_c~0 == 1); 31931#L512-1 assume !(~e_e~0 == 1); 31932#L517-1 assume !(~e_f~0 == 1); 31984#L522-1 assume !(~e_g~0 == 1); 31760#L527-1 assume !(~e_c~0 == 1); 31761#L532-1 assume !(~e_wl~0 == 1); 32448#L674-1 assume true; 32449#L543 assume !false; 32438#L544 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; 32396#L379 [2018-11-10 04:32:41,130 INFO L795 eck$LassoCheckResult]: Loop: 32396#L379 assume true; 32393#L296-1 assume !false; 32390#L297 assume ~wl_st~0 == 0; 32386#L310-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 32379#L323 assume !(eval_~tmp~0 != 0); 32381#L319 assume !(~c1_st~0 == 0); 32579#L334 assume !(~c2_st~0 == 0); 32575#L349 assume !(~wb_st~0 == 0); 32436#L364 assume !(~r_st~0 == 0); 32396#L379 [2018-11-10 04:32:41,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 1 times [2018-11-10 04:32:41,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1545026726, now seen corresponding path program 1 times [2018-11-10 04:32:41,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1751661726, now seen corresponding path program 1 times [2018-11-10 04:32:41,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:41,171 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 04:32:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:41,237 INFO L87 Difference]: Start difference. First operand 4409 states and 6952 transitions. cyclomatic complexity: 2576 Second operand 3 states. [2018-11-10 04:32:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:41,295 INFO L93 Difference]: Finished difference Result 7041 states and 10807 transitions. [2018-11-10 04:32:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:41,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7041 states and 10807 transitions. [2018-11-10 04:32:41,316 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2664 [2018-11-10 04:32:41,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7041 states to 7041 states and 10807 transitions. [2018-11-10 04:32:41,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2760 [2018-11-10 04:32:41,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2760 [2018-11-10 04:32:41,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7041 states and 10807 transitions. [2018-11-10 04:32:41,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:41,346 INFO L705 BuchiCegarLoop]: Abstraction has 7041 states and 10807 transitions. [2018-11-10 04:32:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states and 10807 transitions. [2018-11-10 04:32:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 7026. [2018-11-10 04:32:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7026 states. [2018-11-10 04:32:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 10792 transitions. [2018-11-10 04:32:41,430 INFO L728 BuchiCegarLoop]: Abstraction has 7026 states and 10792 transitions. [2018-11-10 04:32:41,430 INFO L608 BuchiCegarLoop]: Abstraction has 7026 states and 10792 transitions. [2018-11-10 04:32:41,430 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 04:32:41,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7026 states and 10792 transitions. [2018-11-10 04:32:41,445 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2658 [2018-11-10 04:32:41,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:41,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:41,446 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 04:32:41,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:41,446 INFO L793 eck$LassoCheckResult]: Stem: 43380#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; 43179#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; 43180#L406 assume !(~c_req_up~0 == 1); 43181#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 43182#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 43229#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 43285#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 43358#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 43381#L437-1 assume !(~e_f~0 == 0); 43118#L442-1 assume !(~e_g~0 == 0); 43119#L447-1 assume !(~e_e~0 == 0); 43295#L452-1 assume !(~e_c~0 == 0); 43296#L457-1 assume !(~e_wl~0 == 0); 43451#L462-1 assume !(~wl_pc~0 == 1); 43349#L474 assume !(~wl_pc~0 == 2); 43350#L475 assume !(~c1_pc~0 == 1); 43434#L485 assume !(~c2_pc~0 == 1); 43432#L494 assume !(~wb_pc~0 == 1); 43412#L503 assume !(~e_c~0 == 1); 43378#L512-1 assume !(~e_e~0 == 1); 43379#L517-1 assume !(~e_f~0 == 1); 43422#L522-1 assume !(~e_g~0 == 1); 43215#L527-1 assume !(~e_c~0 == 1); 43216#L532-1 assume !(~e_wl~0 == 1); 44108#L674-1 assume true; 44109#L543 assume !false; 44091#L544 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; 44036#L379 [2018-11-10 04:32:41,446 INFO L795 eck$LassoCheckResult]: Loop: 44036#L379 assume true; 44037#L296-1 assume !false; 46236#L297 assume ~wl_st~0 == 0; 46232#L310-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 46229#L323 assume !(eval_~tmp~0 != 0); 46230#L319 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 44357#L338 assume !(eval_~tmp___0~0 != 0); 46333#L334 assume !(~c2_st~0 == 0); 44104#L349 assume !(~wb_st~0 == 0); 44089#L364 assume !(~r_st~0 == 0); 44036#L379 [2018-11-10 04:32:41,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 2 times [2018-11-10 04:32:41,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash -703869043, now seen corresponding path program 1 times [2018-11-10 04:32:41,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1480380549, now seen corresponding path program 1 times [2018-11-10 04:32:41,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:41,495 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 04:32:41,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:41,521 INFO L87 Difference]: Start difference. First operand 7026 states and 10792 transitions. cyclomatic complexity: 3799 Second operand 3 states. [2018-11-10 04:32:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:41,575 INFO L93 Difference]: Finished difference Result 11739 states and 17669 transitions. [2018-11-10 04:32:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:41,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11739 states and 17669 transitions. [2018-11-10 04:32:41,607 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4398 [2018-11-10 04:32:41,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11739 states to 11739 states and 17669 transitions. [2018-11-10 04:32:41,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4578 [2018-11-10 04:32:41,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4578 [2018-11-10 04:32:41,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11739 states and 17669 transitions. [2018-11-10 04:32:41,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:41,644 INFO L705 BuchiCegarLoop]: Abstraction has 11739 states and 17669 transitions. [2018-11-10 04:32:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11739 states and 17669 transitions. [2018-11-10 04:32:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11739 to 11709. [2018-11-10 04:32:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11709 states. [2018-11-10 04:32:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11709 states to 11709 states and 17639 transitions. [2018-11-10 04:32:41,770 INFO L728 BuchiCegarLoop]: Abstraction has 11709 states and 17639 transitions. [2018-11-10 04:32:41,770 INFO L608 BuchiCegarLoop]: Abstraction has 11709 states and 17639 transitions. [2018-11-10 04:32:41,770 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 04:32:41,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11709 states and 17639 transitions. [2018-11-10 04:32:41,793 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4386 [2018-11-10 04:32:41,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:41,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:41,794 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 04:32:41,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:41,794 INFO L793 eck$LassoCheckResult]: Stem: 62163#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; 61952#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; 61953#L406 assume !(~c_req_up~0 == 1); 61954#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 61955#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 62067#L422-1 assume !(~c2_i~0 == 1);~c2_st~0 := 2; 62068#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 65276#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 65275#L437-1 assume !(~e_f~0 == 0); 65274#L442-1 assume !(~e_g~0 == 0); 65273#L447-1 assume !(~e_e~0 == 0); 65272#L452-1 assume !(~e_c~0 == 0); 65271#L457-1 assume !(~e_wl~0 == 0); 65270#L462-1 assume !(~wl_pc~0 == 1); 62133#L474 assume !(~wl_pc~0 == 2); 62134#L475 assume !(~c1_pc~0 == 1); 62234#L485 assume !(~c2_pc~0 == 1); 62233#L494 assume !(~wb_pc~0 == 1); 62204#L503 assume !(~e_c~0 == 1); 62205#L512-1 assume !(~e_e~0 == 1); 62218#L517-1 assume !(~e_f~0 == 1); 62219#L522-1 assume !(~e_g~0 == 1); 61992#L527-1 assume !(~e_c~0 == 1); 61993#L532-1 assume !(~e_wl~0 == 1); 66581#L674-1 assume true; 66577#L543 assume !false; 66578#L544 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; 66602#L379 [2018-11-10 04:32:41,794 INFO L795 eck$LassoCheckResult]: Loop: 66602#L379 assume true; 66601#L296-1 assume !false; 66600#L297 assume ~wl_st~0 == 0; 66599#L310-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 66598#L323 assume !(eval_~tmp~0 != 0); 64953#L319 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 64949#L338 assume !(eval_~tmp___0~0 != 0); 64951#L334 assume !(~c2_st~0 == 0); 66619#L349 assume !(~wb_st~0 == 0); 66603#L364 assume !(~r_st~0 == 0); 66602#L379 [2018-11-10 04:32:41,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash -27079625, now seen corresponding path program 1 times [2018-11-10 04:32:41,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:41,806 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 04:32:41,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:41,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:41,806 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:32:41,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -703869043, now seen corresponding path program 2 times [2018-11-10 04:32:41,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:41,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:41,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:41,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:41,850 INFO L87 Difference]: Start difference. First operand 11709 states and 17639 transitions. cyclomatic complexity: 5963 Second operand 3 states. [2018-11-10 04:32:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:41,866 INFO L93 Difference]: Finished difference Result 11633 states and 17519 transitions. [2018-11-10 04:32:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:41,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11633 states and 17519 transitions. [2018-11-10 04:32:41,888 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4386 [2018-11-10 04:32:41,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11633 states to 11633 states and 17519 transitions. [2018-11-10 04:32:41,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4498 [2018-11-10 04:32:41,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4498 [2018-11-10 04:32:41,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11633 states and 17519 transitions. [2018-11-10 04:32:41,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:41,910 INFO L705 BuchiCegarLoop]: Abstraction has 11633 states and 17519 transitions. [2018-11-10 04:32:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states and 17519 transitions. [2018-11-10 04:32:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 11633. [2018-11-10 04:32:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-11-10 04:32:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 17519 transitions. [2018-11-10 04:32:42,042 INFO L728 BuchiCegarLoop]: Abstraction has 11633 states and 17519 transitions. [2018-11-10 04:32:42,042 INFO L608 BuchiCegarLoop]: Abstraction has 11633 states and 17519 transitions. [2018-11-10 04:32:42,042 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 04:32:42,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11633 states and 17519 transitions. [2018-11-10 04:32:42,054 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4386 [2018-11-10 04:32:42,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:42,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:42,055 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 04:32:42,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:42,055 INFO L793 eck$LassoCheckResult]: Stem: 85515#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; 85305#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; 85306#L406 assume !(~c_req_up~0 == 1); 85350#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 85587#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 85586#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 85585#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 85584#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 85583#L437-1 assume !(~e_f~0 == 0); 85582#L442-1 assume !(~e_g~0 == 0); 85580#L447-1 assume !(~e_e~0 == 0); 85428#L452-1 assume !(~e_c~0 == 0); 85429#L457-1 assume !(~e_wl~0 == 0); 85521#L462-1 assume !(~wl_pc~0 == 1); 85493#L474 assume !(~wl_pc~0 == 2); 85592#L475 assume !(~c1_pc~0 == 1); 85589#L485 assume !(~c2_pc~0 == 1); 85579#L494 assume !(~wb_pc~0 == 1); 85559#L503 assume !(~e_c~0 == 1); 85560#L512-1 assume !(~e_e~0 == 1); 85577#L517-1 assume !(~e_f~0 == 1); 85563#L522-1 assume !(~e_g~0 == 1); 85338#L527-1 assume !(~e_c~0 == 1); 85339#L532-1 assume !(~e_wl~0 == 1); 86804#L674-1 assume true; 86800#L543 assume !false; 86802#L544 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; 86841#L379 [2018-11-10 04:32:42,055 INFO L795 eck$LassoCheckResult]: Loop: 86841#L379 assume true; 86839#L296-1 assume !false; 86837#L297 assume ~wl_st~0 == 0; 86836#L310-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 86833#L323 assume !(eval_~tmp~0 != 0); 86835#L319 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 87027#L338 assume !(eval_~tmp___0~0 != 0); 87028#L334 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 86568#L353 assume !(eval_~tmp___1~0 != 0); 86596#L349 assume !(~wb_st~0 == 0); 86843#L364 assume !(~r_st~0 == 0); 86841#L379 [2018-11-10 04:32:42,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 3 times [2018-11-10 04:32:42,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -346785337, now seen corresponding path program 1 times [2018-11-10 04:32:42,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1354524721, now seen corresponding path program 1 times [2018-11-10 04:32:42,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:42,082 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 04:32:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:42,109 INFO L87 Difference]: Start difference. First operand 11633 states and 17519 transitions. cyclomatic complexity: 5919 Second operand 3 states. [2018-11-10 04:32:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:42,154 INFO L93 Difference]: Finished difference Result 20131 states and 29893 transitions. [2018-11-10 04:32:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:42,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20131 states and 29893 transitions. [2018-11-10 04:32:42,190 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7574 [2018-11-10 04:32:42,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20131 states to 20131 states and 29893 transitions. [2018-11-10 04:32:42,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7718 [2018-11-10 04:32:42,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7718 [2018-11-10 04:32:42,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20131 states and 29893 transitions. [2018-11-10 04:32:42,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:32:42,233 INFO L705 BuchiCegarLoop]: Abstraction has 20131 states and 29893 transitions. [2018-11-10 04:32:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states and 29893 transitions. [2018-11-10 04:32:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131. [2018-11-10 04:32:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20131 states. [2018-11-10 04:32:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 29893 transitions. [2018-11-10 04:32:42,357 INFO L728 BuchiCegarLoop]: Abstraction has 20131 states and 29893 transitions. [2018-11-10 04:32:42,357 INFO L608 BuchiCegarLoop]: Abstraction has 20131 states and 29893 transitions. [2018-11-10 04:32:42,357 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 04:32:42,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20131 states and 29893 transitions. [2018-11-10 04:32:42,384 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7574 [2018-11-10 04:32:42,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:32:42,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:32:42,384 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 04:32:42,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:42,385 INFO L793 eck$LassoCheckResult]: Stem: 117288#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; 117077#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; 117078#L406 assume !(~c_req_up~0 == 1); 117121#L406-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 117364#L417-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 117363#L422-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 117362#L427-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 117361#L432-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 117360#L437-1 assume !(~e_f~0 == 0); 117359#L442-1 assume !(~e_g~0 == 0); 117357#L447-1 assume !(~e_e~0 == 0); 117199#L452-1 assume !(~e_c~0 == 0); 117200#L457-1 assume !(~e_wl~0 == 0); 117293#L462-1 assume !(~wl_pc~0 == 1); 117262#L474 assume !(~wl_pc~0 == 2); 117369#L475 assume !(~c1_pc~0 == 1); 117366#L485 assume !(~c2_pc~0 == 1); 117356#L494 assume !(~wb_pc~0 == 1); 117329#L503 assume !(~e_c~0 == 1); 117330#L512-1 assume !(~e_e~0 == 1); 117354#L517-1 assume !(~e_f~0 == 1); 117335#L522-1 assume !(~e_g~0 == 1); 117109#L527-1 assume !(~e_c~0 == 1); 117110#L532-1 assume !(~e_wl~0 == 1); 119097#L674-1 assume true; 119098#L543 assume !false; 119050#L544 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; 119048#L379 [2018-11-10 04:32:42,385 INFO L795 eck$LassoCheckResult]: Loop: 119048#L379 assume true; 125678#L296-1 assume !false; 125675#L297 assume ~wl_st~0 == 0; 125673#L310-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 118945#L323 assume !(eval_~tmp~0 != 0); 118946#L319 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 125625#L338 assume !(eval_~tmp___0~0 != 0); 125839#L334 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 125831#L353 assume !(eval_~tmp___1~0 != 0); 119096#L349 assume ~wb_st~0 == 0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 119056#L368 assume !(eval_~tmp___2~0 != 0); 119047#L364 assume !(~r_st~0 == 0); 119048#L379 [2018-11-10 04:32:42,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 4 times [2018-11-10 04:32:42,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2134520096, now seen corresponding path program 1 times [2018-11-10 04:32:42,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:32:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash 959370264, now seen corresponding path program 1 times [2018-11-10 04:32:42,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:32:42,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:32:42,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:42,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:42,702 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-11-10 04:32:42,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:32:42 BoogieIcfgContainer [2018-11-10 04:32:42,765 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:32:42,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:32:42,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:32:42,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:32:42,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:37" (3/4) ... [2018-11-10 04:32:42,768 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 04:32:42,836 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e7ab770-fed4-4911-8890-dc4f7bb4c0d1/bin-2019/uautomizer/witness.graphml [2018-11-10 04:32:42,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:32:42,837 INFO L168 Benchmark]: Toolchain (without parser) took 6236.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.0 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -228.8 MB). Peak memory consumption was 388.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,837 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 04:32:42,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.38 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 04:32:42,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,838 INFO L168 Benchmark]: Boogie Preprocessor took 60.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,839 INFO L168 Benchmark]: RCFGBuilder took 425.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,839 INFO L168 Benchmark]: BuchiAutomizer took 5434.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 794.3 MB in the end (delta: 295.4 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,839 INFO L168 Benchmark]: Witness Printer took 71.26 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Free memory was 794.3 MB in the beginning and 1.2 GB in the end (delta: -393.7 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-11-10 04:32:42,841 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 210.38 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 31.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5434.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 794.3 MB in the end (delta: 295.4 MB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. * Witness Printer took 71.26 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Free memory was 794.3 MB in the beginning and 1.2 GB in the end (delta: -393.7 MB). Peak memory consumption was 8.2 kB. 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 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_g + 3 and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 20131 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 275 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 20131 states and ocurred in iteration 15. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4115 SDtfs, 2955 SDslu, 2173 SDs, 0 SdLazy, 263 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf97 smp100 dnf180 smp81 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 296]: 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@471e6375=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32c54ac8=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e1f886a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76141f6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f417223=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: 296]: 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 ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L712] CALL start_simulation() [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) [L467] COND FALSE !((int )wl_pc == 1) [L475] COND FALSE !((int )wl_pc == 2) [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) [L543] COND TRUE 1 [L546] kernel_st = 1 [L547] CALL eval() [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; Loop: [L296] COND TRUE 1 [L298] COND TRUE (int )wl_st == 0 [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND FALSE !(\read(tmp)) [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND FALSE !(\read(tmp___0)) [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp___1)) [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND FALSE !(\read(tmp___2)) [L379] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...