./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:09:16,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:09:16,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:09:16,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:09:16,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:09:16,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:09:16,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:09:16,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:09:16,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:09:16,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:09:16,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:09:16,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:09:16,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:09:16,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:09:16,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:09:16,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:09:16,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:09:16,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:09:16,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:09:16,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:09:16,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:09:16,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:09:16,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:09:16,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:09:16,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:09:16,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:09:16,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:09:16,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:09:16,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:09:16,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:09:16,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:09:16,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:09:16,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:09:16,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:09:16,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:09:16,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:09:16,756 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:09:16,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:09:16,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:09:16,768 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:09:16,769 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:09:16,769 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:09:16,770 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:09:16,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:09:16,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:09:16,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:09:16,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:09:16,773 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:09:16,773 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:09:16,773 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_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2018-11-22 22:09:16,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:09:16,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:09:16,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:09:16,812 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:09:16,812 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:09:16,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-22 22:09:16,851 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/data/ba9f590e9/a306b200d4d74911912ccb8f04bd855a/FLAGe47fb19cd [2018-11-22 22:09:17,273 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:09:17,274 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/sv-benchmarks/c/systemc/toy_true-unreach-call_false-termination.cil.c [2018-11-22 22:09:17,282 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/data/ba9f590e9/a306b200d4d74911912ccb8f04bd855a/FLAGe47fb19cd [2018-11-22 22:09:17,292 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/data/ba9f590e9/a306b200d4d74911912ccb8f04bd855a [2018-11-22 22:09:17,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:09:17,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:09:17,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:09:17,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:09:17,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:09:17,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab3e4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17, skipping insertion in model container [2018-11-22 22:09:17,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:09:17,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:09:17,473 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:09:17,476 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:09:17,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:09:17,518 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:09:17,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17 WrapperNode [2018-11-22 22:09:17,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:09:17,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:09:17,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:09:17,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:09:17,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:09:17,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:09:17,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:09:17,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:09:17,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... [2018-11-22 22:09:17,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:09:17,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:09:17,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:09:17,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:09:17,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:09:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:09:18,034 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:09:18,034 INFO L280 CfgBuilder]: Removed 26 assue(true) statements. [2018-11-22 22:09:18,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:18 BoogieIcfgContainer [2018-11-22 22:09:18,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:09:18,035 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:09:18,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:09:18,038 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:09:18,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:09:18,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:09:17" (1/3) ... [2018-11-22 22:09:18,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3f4856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:09:18, skipping insertion in model container [2018-11-22 22:09:18,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:09:18,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:17" (2/3) ... [2018-11-22 22:09:18,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3f4856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:09:18, skipping insertion in model container [2018-11-22 22:09:18,041 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:09:18,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:18" (3/3) ... [2018-11-22 22:09:18,042 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy_true-unreach-call_false-termination.cil.c [2018-11-22 22:09:18,083 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:09:18,083 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:09:18,083 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:09:18,083 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:09:18,083 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:09:18,084 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:09:18,084 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:09:18,084 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:09:18,084 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:09:18,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2018-11-22 22:09:18,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-11-22 22:09:18,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,117 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-22 22:09:18,117 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] [2018-11-22 22:09:18,117 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:09:18,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2018-11-22 22:09:18,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-11-22 22:09:18,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,124 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-22 22:09:18,124 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] [2018-11-22 22:09:18,129 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 14#L-1true 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4#L398true assume !(1 == ~c_req_up~0); 8#L398-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 7#L409-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 31#L414-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 52#L419-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 74#L424-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 100#L429-1true assume !(0 == ~e_f~0); 122#L434-1true assume !(0 == ~e_g~0); 28#L439-1true assume !(0 == ~e_e~0); 48#L444-1true assume !(0 == ~e_c~0); 71#L449-1true assume !(0 == ~e_wl~0); 94#L454-1true assume !(1 == ~wl_pc~0); 47#L466true assume !(2 == ~wl_pc~0); 120#L467true assume !(1 == ~c1_pc~0); 45#L477true assume !(1 == ~c2_pc~0); 19#L486true assume !(1 == ~wb_pc~0); 111#L495true assume !(1 == ~e_c~0); 68#L504-1true assume !(1 == ~e_e~0); 92#L509-1true assume !(1 == ~e_f~0); 117#L514-1true assume !(1 == ~e_g~0); 20#L519-1true assume !(1 == ~e_c~0); 42#L524-1true assume !(1 == ~e_wl~0); 79#L666-1true [2018-11-22 22:09:18,130 INFO L796 eck$LassoCheckResult]: Loop: 79#L666-1true assume !false; 114#L536true start_simulation_~kernel_st~0 := 1;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; 107#L371true assume false; 6#L387true start_simulation_~kernel_st~0 := 2; 86#L542true assume !(1 == ~c_req_up~0); 93#L542-2true start_simulation_~kernel_st~0 := 3; 58#L554true assume 0 == ~e_f~0;~e_f~0 := 1; 44#L554-2true assume 0 == ~e_g~0;~e_g~0 := 1; 67#L559-1true assume !(0 == ~e_e~0); 88#L564-1true assume 0 == ~e_c~0;~e_c~0 := 1; 115#L569-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 18#L574-1true assume 1 == ~wl_pc~0; 112#L580true assume 1 == ~e_wl~0;~wl_st~0 := 0; 56#L587true assume !(1 == ~c1_pc~0); 103#L597true assume !(1 == ~c2_pc~0); 61#L606true assume !(1 == ~wb_pc~0); 33#L615true assume 1 == ~e_c~0;~r_st~0 := 0; 127#L624-1true assume 1 == ~e_e~0;~e_e~0 := 2; 16#L629-1true assume 1 == ~e_f~0;~e_f~0 := 2; 38#L634-1true assume !(1 == ~e_g~0); 62#L639-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L644-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 110#L649-1true assume 0 == ~wl_st~0; 79#L666-1true [2018-11-22 22:09:18,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-22 22:09:18,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,243 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-22 22:09:18,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:18,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash 359392569, now seen corresponding path program 1 times [2018-11-22 22:09:18,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,255 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-22 22:09:18,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:09:18,257 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:09:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:09:18,275 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2018-11-22 22:09:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:18,287 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2018-11-22 22:09:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:09:18,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2018-11-22 22:09:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2018-11-22 22:09:18,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-22 22:09:18,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-22 22:09:18,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2018-11-22 22:09:18,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:09:18,299 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-22 22:09:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2018-11-22 22:09:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-22 22:09:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-22 22:09:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2018-11-22 22:09:18,328 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-22 22:09:18,328 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2018-11-22 22:09:18,328 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:09:18,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2018-11-22 22:09:18,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,330 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-22 22:09:18,330 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] [2018-11-22 22:09:18,330 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY ~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; 281#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 259#L398 assume !(1 == ~c_req_up~0); 261#L398-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 267#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 268#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 314#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 346#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 363#L429-1 assume !(0 == ~e_f~0); 374#L434-1 assume !(0 == ~e_g~0); 309#L439-1 assume !(0 == ~e_e~0); 310#L444-1 assume !(0 == ~e_c~0); 342#L449-1 assume !(0 == ~e_wl~0); 361#L454-1 assume !(1 == ~wl_pc~0); 339#L466 assume !(2 == ~wl_pc~0); 340#L467 assume !(1 == ~c1_pc~0); 335#L477 assume !(1 == ~c2_pc~0); 291#L486 assume !(1 == ~wb_pc~0); 292#L495 assume !(1 == ~e_c~0); 357#L504-1 assume !(1 == ~e_e~0); 358#L509-1 assume !(1 == ~e_f~0); 371#L514-1 assume !(1 == ~e_g~0); 294#L519-1 assume !(1 == ~e_c~0); 295#L524-1 assume !(1 == ~e_wl~0); 331#L666-1 [2018-11-22 22:09:18,331 INFO L796 eck$LassoCheckResult]: Loop: 331#L666-1 assume !false; 364#L536 start_simulation_~kernel_st~0 := 1;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; 270#L371 assume !false; 370#L289 assume !(0 == ~wl_st~0); 304#L293 assume !(0 == ~c1_st~0); 273#L296 assume !(0 == ~c2_st~0); 275#L299 assume !(0 == ~wb_st~0); 287#L302 assume !(0 == ~r_st~0); 265#L387 start_simulation_~kernel_st~0 := 2; 266#L542 assume !(1 == ~c_req_up~0); 338#L542-2 start_simulation_~kernel_st~0 := 3; 350#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 333#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 334#L559-1 assume !(0 == ~e_e~0); 356#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 369#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 288#L574-1 assume 1 == ~wl_pc~0; 289#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 272#L587 assume !(1 == ~c1_pc~0); 349#L597 assume !(1 == ~c2_pc~0); 313#L606 assume !(1 == ~wb_pc~0); 316#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 317#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 285#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 286#L634-1 assume !(1 == ~e_g~0); 326#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 354#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 365#L649-1 assume 0 == ~wl_st~0; 331#L666-1 [2018-11-22 22:09:18,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-22 22:09:18,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,363 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-22 22:09:18,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,364 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:18,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 1 times [2018-11-22 22:09:18,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,387 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-22 22:09:18,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,388 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:18,389 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2018-11-22 22:09:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:18,403 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2018-11-22 22:09:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:18,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2018-11-22 22:09:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2018-11-22 22:09:18,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-22 22:09:18,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-22 22:09:18,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2018-11-22 22:09:18,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:09:18,408 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-22 22:09:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2018-11-22 22:09:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-22 22:09:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-22 22:09:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2018-11-22 22:09:18,412 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-22 22:09:18,413 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2018-11-22 22:09:18,413 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:09:18,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2018-11-22 22:09:18,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,414 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-22 22:09:18,414 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] [2018-11-22 22:09:18,415 INFO L794 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY ~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; 528#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 506#L398 assume !(1 == ~c_req_up~0); 508#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 514#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 515#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 561#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 593#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 610#L429-1 assume !(0 == ~e_f~0); 621#L434-1 assume !(0 == ~e_g~0); 556#L439-1 assume !(0 == ~e_e~0); 557#L444-1 assume !(0 == ~e_c~0); 589#L449-1 assume !(0 == ~e_wl~0); 608#L454-1 assume !(1 == ~wl_pc~0); 586#L466 assume !(2 == ~wl_pc~0); 587#L467 assume !(1 == ~c1_pc~0); 582#L477 assume !(1 == ~c2_pc~0); 538#L486 assume !(1 == ~wb_pc~0); 539#L495 assume !(1 == ~e_c~0); 604#L504-1 assume !(1 == ~e_e~0); 605#L509-1 assume !(1 == ~e_f~0); 618#L514-1 assume !(1 == ~e_g~0); 541#L519-1 assume !(1 == ~e_c~0); 542#L524-1 assume !(1 == ~e_wl~0); 578#L666-1 [2018-11-22 22:09:18,415 INFO L796 eck$LassoCheckResult]: Loop: 578#L666-1 assume !false; 611#L536 start_simulation_~kernel_st~0 := 1;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; 517#L371 assume !false; 617#L289 assume !(0 == ~wl_st~0); 551#L293 assume !(0 == ~c1_st~0); 520#L296 assume !(0 == ~c2_st~0); 522#L299 assume !(0 == ~wb_st~0); 534#L302 assume !(0 == ~r_st~0); 512#L387 start_simulation_~kernel_st~0 := 2; 513#L542 assume !(1 == ~c_req_up~0); 585#L542-2 start_simulation_~kernel_st~0 := 3; 597#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 580#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 581#L559-1 assume !(0 == ~e_e~0); 603#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 616#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 535#L574-1 assume 1 == ~wl_pc~0; 536#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 519#L587 assume !(1 == ~c1_pc~0); 596#L597 assume !(1 == ~c2_pc~0); 560#L606 assume !(1 == ~wb_pc~0); 563#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 564#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 532#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 533#L634-1 assume !(1 == ~e_g~0); 573#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 601#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 612#L649-1 assume 0 == ~wl_st~0; 578#L666-1 [2018-11-22 22:09:18,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-22 22:09:18,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,437 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-22 22:09:18,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,437 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:18,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 2 times [2018-11-22 22:09:18,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,461 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-22 22:09:18,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,462 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:18,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:18,462 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-22 22:09:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:18,471 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2018-11-22 22:09:18,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:18,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2018-11-22 22:09:18,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2018-11-22 22:09:18,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-22 22:09:18,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-22 22:09:18,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2018-11-22 22:09:18,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:09:18,475 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-22 22:09:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2018-11-22 22:09:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-22 22:09:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-22 22:09:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2018-11-22 22:09:18,478 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-22 22:09:18,478 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2018-11-22 22:09:18,478 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:09:18,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2018-11-22 22:09:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,479 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-22 22:09:18,479 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] [2018-11-22 22:09:18,480 INFO L794 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY ~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; 775#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 753#L398 assume !(1 == ~c_req_up~0); 755#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 761#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 762#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 808#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 840#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 857#L429-1 assume !(0 == ~e_f~0); 868#L434-1 assume !(0 == ~e_g~0); 803#L439-1 assume !(0 == ~e_e~0); 804#L444-1 assume !(0 == ~e_c~0); 836#L449-1 assume !(0 == ~e_wl~0); 855#L454-1 assume !(1 == ~wl_pc~0); 833#L466 assume !(2 == ~wl_pc~0); 834#L467 assume !(1 == ~c1_pc~0); 829#L477 assume !(1 == ~c2_pc~0); 785#L486 assume !(1 == ~wb_pc~0); 786#L495 assume !(1 == ~e_c~0); 851#L504-1 assume !(1 == ~e_e~0); 852#L509-1 assume !(1 == ~e_f~0); 865#L514-1 assume !(1 == ~e_g~0); 788#L519-1 assume !(1 == ~e_c~0); 789#L524-1 assume !(1 == ~e_wl~0); 825#L666-1 [2018-11-22 22:09:18,480 INFO L796 eck$LassoCheckResult]: Loop: 825#L666-1 assume !false; 858#L536 start_simulation_~kernel_st~0 := 1;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; 764#L371 assume !false; 864#L289 assume !(0 == ~wl_st~0); 798#L293 assume !(0 == ~c1_st~0); 767#L296 assume !(0 == ~c2_st~0); 769#L299 assume !(0 == ~wb_st~0); 781#L302 assume !(0 == ~r_st~0); 759#L387 start_simulation_~kernel_st~0 := 2; 760#L542 assume !(1 == ~c_req_up~0); 832#L542-2 start_simulation_~kernel_st~0 := 3; 844#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 827#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 828#L559-1 assume !(0 == ~e_e~0); 850#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 863#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L574-1 assume !(1 == ~wl_pc~0); 784#L586 assume !(2 == ~wl_pc~0); 766#L587 assume !(1 == ~c1_pc~0); 843#L597 assume !(1 == ~c2_pc~0); 807#L606 assume !(1 == ~wb_pc~0); 810#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 811#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 779#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 780#L634-1 assume !(1 == ~e_g~0); 820#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 848#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 859#L649-1 assume 0 == ~wl_st~0; 825#L666-1 [2018-11-22 22:09:18,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-22 22:09:18,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,514 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-22 22:09:18,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,515 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:18,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1257113092, now seen corresponding path program 1 times [2018-11-22 22:09:18,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,540 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-22 22:09:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:18,541 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-22 22:09:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:18,550 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2018-11-22 22:09:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:18,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2018-11-22 22:09:18,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2018-11-22 22:09:18,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-22 22:09:18,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2018-11-22 22:09:18,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2018-11-22 22:09:18,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:09:18,554 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-22 22:09:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2018-11-22 22:09:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-22 22:09:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-22 22:09:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2018-11-22 22:09:18,558 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-22 22:09:18,558 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2018-11-22 22:09:18,558 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:09:18,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2018-11-22 22:09:18,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:09:18,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,560 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-22 22:09:18,560 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] [2018-11-22 22:09:18,560 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY ~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; 1022#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1000#L398 assume !(1 == ~c_req_up~0); 1002#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1008#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1009#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1055#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1087#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1104#L429-1 assume !(0 == ~e_f~0); 1115#L434-1 assume !(0 == ~e_g~0); 1050#L439-1 assume !(0 == ~e_e~0); 1051#L444-1 assume !(0 == ~e_c~0); 1083#L449-1 assume !(0 == ~e_wl~0); 1102#L454-1 assume !(1 == ~wl_pc~0); 1080#L466 assume !(2 == ~wl_pc~0); 1081#L467 assume !(1 == ~c1_pc~0); 1076#L477 assume !(1 == ~c2_pc~0); 1032#L486 assume !(1 == ~wb_pc~0); 1033#L495 assume !(1 == ~e_c~0); 1098#L504-1 assume !(1 == ~e_e~0); 1099#L509-1 assume !(1 == ~e_f~0); 1112#L514-1 assume !(1 == ~e_g~0); 1035#L519-1 assume !(1 == ~e_c~0); 1036#L524-1 assume !(1 == ~e_wl~0); 1072#L666-1 [2018-11-22 22:09:18,560 INFO L796 eck$LassoCheckResult]: Loop: 1072#L666-1 assume !false; 1105#L536 start_simulation_~kernel_st~0 := 1;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; 1011#L371 assume !false; 1111#L289 assume !(0 == ~wl_st~0); 1045#L293 assume !(0 == ~c1_st~0); 1014#L296 assume !(0 == ~c2_st~0); 1016#L299 assume !(0 == ~wb_st~0); 1028#L302 assume !(0 == ~r_st~0); 1006#L387 start_simulation_~kernel_st~0 := 2; 1007#L542 assume !(1 == ~c_req_up~0); 1079#L542-2 start_simulation_~kernel_st~0 := 3; 1091#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1074#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1075#L559-1 assume !(0 == ~e_e~0); 1097#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1110#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1029#L574-1 assume 1 == ~wl_pc~0; 1030#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1013#L587 assume !(1 == ~c1_pc~0); 1090#L597 assume !(1 == ~c2_pc~0); 1054#L606 assume !(1 == ~wb_pc~0); 1057#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1058#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1026#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1027#L634-1 assume !(1 == ~e_g~0); 1067#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1095#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1106#L649-1 assume 0 == ~wl_st~0; 1072#L666-1 [2018-11-22 22:09:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-22 22:09:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:18,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 3 times [2018-11-22 22:09:18,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,609 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-22 22:09:18,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:18,609 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:18,611 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-22 22:09:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:18,652 INFO L93 Difference]: Finished difference Result 154 states and 273 transitions. [2018-11-22 22:09:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:18,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 273 transitions. [2018-11-22 22:09:18,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-22 22:09:18,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 273 transitions. [2018-11-22 22:09:18,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-22 22:09:18,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-22 22:09:18,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 273 transitions. [2018-11-22 22:09:18,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:09:18,655 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-22 22:09:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 273 transitions. [2018-11-22 22:09:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-22 22:09:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-22 22:09:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 273 transitions. [2018-11-22 22:09:18,662 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-22 22:09:18,662 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2018-11-22 22:09:18,662 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:09:18,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 273 transitions. [2018-11-22 22:09:18,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-22 22:09:18,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:18,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:18,664 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-22 22:09:18,664 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] [2018-11-22 22:09:18,664 INFO L794 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY ~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; 1302#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1280#L398 assume !(1 == ~c_req_up~0); 1282#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1288#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1289#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1335#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1368#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1387#L429-1 assume !(0 == ~e_f~0); 1398#L434-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1403#L439-1 assume !(0 == ~e_e~0); 1417#L444-1 assume !(0 == ~e_c~0); 1416#L449-1 assume !(0 == ~e_wl~0); 1415#L454-1 assume !(1 == ~wl_pc~0); 1413#L466 assume !(2 == ~wl_pc~0); 1411#L467 assume !(1 == ~c1_pc~0); 1409#L477 assume !(1 == ~c2_pc~0); 1407#L486 assume !(1 == ~wb_pc~0); 1379#L495 assume !(1 == ~e_c~0); 1381#L504-1 assume !(1 == ~e_e~0); 1382#L509-1 assume !(1 == ~e_f~0); 1395#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1315#L519-1 assume !(1 == ~e_c~0); 1316#L524-1 assume !(1 == ~e_wl~0); 1352#L666-1 [2018-11-22 22:09:18,664 INFO L796 eck$LassoCheckResult]: Loop: 1352#L666-1 assume !false; 1388#L536 start_simulation_~kernel_st~0 := 1;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; 1291#L371 assume !false; 1394#L289 assume !(0 == ~wl_st~0); 1325#L293 assume !(0 == ~c1_st~0); 1294#L296 assume !(0 == ~c2_st~0); 1296#L299 assume !(0 == ~wb_st~0); 1308#L302 assume !(0 == ~r_st~0); 1286#L387 start_simulation_~kernel_st~0 := 2; 1287#L542 assume !(1 == ~c_req_up~0); 1360#L542-2 start_simulation_~kernel_st~0 := 3; 1372#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1354#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1355#L559-1 assume !(0 == ~e_e~0); 1380#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1393#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1309#L574-1 assume 1 == ~wl_pc~0; 1310#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1293#L587 assume !(1 == ~c1_pc~0); 1371#L597 assume !(1 == ~c2_pc~0); 1334#L606 assume !(1 == ~wb_pc~0); 1337#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1338#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1306#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1307#L634-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1347#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1376#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1389#L649-1 assume 0 == ~wl_st~0; 1352#L666-1 [2018-11-22 22:09:18,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2018-11-22 22:09:18,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:18,711 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-22 22:09:18,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:18,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:09:18,711 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:18,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1806432395, now seen corresponding path program 1 times [2018-11-22 22:09:18,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:18,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:18,830 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-22 22:09:18,888 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:18,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:18,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:18,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:18,890 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:09:18,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:18,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:18,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:18,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-22 22:09:18,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:18,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:18,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-22 22:09:18,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,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-22 22:09:18,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:18,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:19,134 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:19,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:19,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:19,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:19,142 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:19,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:19,157 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:19,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:09:19,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:19,177 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:09:19,191 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:19,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:19,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:19,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:19,191 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:09:19,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:19,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:19,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:19,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-22 22:09:19,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:19,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:19,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,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-22 22:09:19,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,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-22 22:09:19,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:19,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-22 22:09:19,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-22 22:09:19,439 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:19,443 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:09:19,445 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-22 22:09:19,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:19,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:19,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:19,448 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:19,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:19,450 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:19,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:19,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:19,454 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-22 22:09:19,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:19,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:19,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:19,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:19,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:19,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:19,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:19,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:09:19,461 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:09:19,461 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:09:19,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:09:19,463 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:09:19,464 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:09:19,464 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-22 22:09:19,465 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:09:19,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:19,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:19,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:19,573 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-22 22:09:19,576 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-22 22:09:19,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120 Second operand 5 states. [2018-11-22 22:09:19,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 480 states and 845 transitions. Complement of second has 5 states. [2018-11-22 22:09:19,670 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-22 22:09:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:09:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2018-11-22 22:09:19,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2018-11-22 22:09:19,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:19,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2018-11-22 22:09:19,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:19,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2018-11-22 22:09:19,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:19,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 845 transitions. [2018-11-22 22:09:19,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 318 [2018-11-22 22:09:19,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 480 states and 845 transitions. [2018-11-22 22:09:19,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2018-11-22 22:09:19,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-11-22 22:09:19,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 845 transitions. [2018-11-22 22:09:19,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:19,689 INFO L705 BuchiCegarLoop]: Abstraction has 480 states and 845 transitions. [2018-11-22 22:09:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 845 transitions. [2018-11-22 22:09:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 370. [2018-11-22 22:09:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-22 22:09:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 653 transitions. [2018-11-22 22:09:19,702 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 653 transitions. [2018-11-22 22:09:19,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:09:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:09:19,702 INFO L87 Difference]: Start difference. First operand 370 states and 653 transitions. Second operand 4 states. [2018-11-22 22:09:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:19,776 INFO L93 Difference]: Finished difference Result 570 states and 982 transitions. [2018-11-22 22:09:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:09:19,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 982 transitions. [2018-11-22 22:09:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2018-11-22 22:09:19,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 982 transitions. [2018-11-22 22:09:19,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2018-11-22 22:09:19,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2018-11-22 22:09:19,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 982 transitions. [2018-11-22 22:09:19,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:19,782 INFO L705 BuchiCegarLoop]: Abstraction has 570 states and 982 transitions. [2018-11-22 22:09:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 982 transitions. [2018-11-22 22:09:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2018-11-22 22:09:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-22 22:09:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 942 transitions. [2018-11-22 22:09:19,791 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2018-11-22 22:09:19,791 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2018-11-22 22:09:19,791 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:09:19,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 942 transitions. [2018-11-22 22:09:19,793 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2018-11-22 22:09:19,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:19,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:19,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] [2018-11-22 22:09:19,794 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] [2018-11-22 22:09:19,794 INFO L794 eck$LassoCheckResult]: Stem: 3246#ULTIMATE.startENTRY ~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; 3073#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3034#L398 assume !(1 == ~c_req_up~0); 3036#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3047#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3048#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3132#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3193#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L429-1 assume !(0 == ~e_f~0); 3264#L434-1 assume !(0 == ~e_g~0); 3124#L439-1 assume !(0 == ~e_e~0); 3125#L444-1 assume !(0 == ~e_c~0); 3185#L449-1 assume !(0 == ~e_wl~0); 3228#L454-1 assume !(1 == ~wl_pc~0); 3182#L466 assume !(2 == ~wl_pc~0); 3183#L467 assume !(1 == ~c1_pc~0); 3176#L477 assume !(1 == ~c2_pc~0); 3092#L486 assume !(1 == ~wb_pc~0); 3093#L495 assume !(1 == ~e_c~0); 3316#L504-1 assume !(1 == ~e_e~0); 3314#L509-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3313#L514-1 assume !(1 == ~e_g~0); 3280#L519-1 assume !(1 == ~e_c~0); 3312#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3232#L666-1 [2018-11-22 22:09:19,794 INFO L796 eck$LassoCheckResult]: Loop: 3232#L666-1 assume !false; 3233#L536 start_simulation_~kernel_st~0 := 1;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; 3050#L371 assume !false; 3251#L289 assume !(0 == ~wl_st~0); 3114#L293 assume !(0 == ~c1_st~0); 3057#L296 assume !(0 == ~c2_st~0); 3059#L299 assume !(0 == ~wb_st~0); 3084#L302 assume !(0 == ~r_st~0); 3043#L387 start_simulation_~kernel_st~0 := 2; 3044#L542 assume !(1 == ~c_req_up~0); 3179#L542-2 start_simulation_~kernel_st~0 := 3; 3256#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 3350#L554-2 assume !(0 == ~e_g~0); 3352#L559-1 assume !(0 == ~e_e~0); 3351#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3278#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3086#L574-1 assume !(1 == ~wl_pc~0); 3088#L586 assume !(2 == ~wl_pc~0); 3054#L587 assume !(1 == ~c1_pc~0); 3198#L597 assume !(1 == ~c2_pc~0); 3129#L606 assume !(1 == ~wb_pc~0); 3210#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 3559#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3558#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3499#L634-1 assume !(1 == ~e_g~0); 3155#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3214#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3238#L649-1 assume 0 == ~wl_st~0; 3232#L666-1 [2018-11-22 22:09:19,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2018-11-22 22:09:19,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:19,820 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-22 22:09:19,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:19,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:09:19,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:19,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2016785850, now seen corresponding path program 1 times [2018-11-22 22:09:19,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:19,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:19,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:19,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:19,831 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-22 22:09:19,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:19,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:09:19,832 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:09:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:09:19,833 INFO L87 Difference]: Start difference. First operand 542 states and 942 transitions. cyclomatic complexity: 406 Second operand 4 states. [2018-11-22 22:09:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:19,915 INFO L93 Difference]: Finished difference Result 1129 states and 1896 transitions. [2018-11-22 22:09:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:09:19,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1896 transitions. [2018-11-22 22:09:19,921 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 690 [2018-11-22 22:09:19,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 1129 states and 1896 transitions. [2018-11-22 22:09:19,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2018-11-22 22:09:19,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2018-11-22 22:09:19,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1129 states and 1896 transitions. [2018-11-22 22:09:19,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:19,926 INFO L705 BuchiCegarLoop]: Abstraction has 1129 states and 1896 transitions. [2018-11-22 22:09:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states and 1896 transitions. [2018-11-22 22:09:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1111. [2018-11-22 22:09:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-11-22 22:09:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1875 transitions. [2018-11-22 22:09:19,939 INFO L728 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2018-11-22 22:09:19,939 INFO L608 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2018-11-22 22:09:19,939 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:09:19,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1875 transitions. [2018-11-22 22:09:19,942 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 688 [2018-11-22 22:09:19,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:19,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:19,943 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-22 22:09:19,943 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] [2018-11-22 22:09:19,943 INFO L794 eck$LassoCheckResult]: Stem: 4965#ULTIMATE.startENTRY ~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; 4768#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4722#L398 assume !(1 == ~c_req_up~0); 4724#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4739#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4826#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4827#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4940#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4941#L429-1 assume !(0 == ~e_f~0); 5013#L434-1 assume !(0 == ~e_g~0); 5014#L439-1 assume !(0 == ~e_e~0); 4882#L444-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4883#L449-1 assume !(0 == ~e_wl~0); 4936#L454-1 assume !(1 == ~wl_pc~0); 4879#L466 assume !(2 == ~wl_pc~0); 4880#L467 assume !(1 == ~c1_pc~0); 4876#L477 assume !(1 == ~c2_pc~0); 4878#L486 assume !(1 == ~wb_pc~0); 5032#L495 assume !(1 == ~e_c~0); 5030#L504-1 assume !(1 == ~e_e~0); 5028#L509-1 assume !(1 == ~e_f~0); 5025#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5022#L519-1 assume !(1 == ~e_c~0); 5023#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5196#L666-1 [2018-11-22 22:09:19,943 INFO L796 eck$LassoCheckResult]: Loop: 5196#L666-1 assume !false; 5346#L536 start_simulation_~kernel_st~0 := 1;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; 5718#L371 assume !false; 5717#L289 assume !(0 == ~wl_st~0); 5716#L293 assume !(0 == ~c1_st~0); 5715#L296 assume !(0 == ~c2_st~0); 5714#L299 assume !(0 == ~wb_st~0); 5322#L302 assume !(0 == ~r_st~0); 5320#L387 start_simulation_~kernel_st~0 := 2; 5313#L542 assume !(1 == ~c_req_up~0); 5312#L542-2 start_simulation_~kernel_st~0 := 3; 5305#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 5303#L554-2 assume !(0 == ~e_g~0); 5301#L559-1 assume !(0 == ~e_e~0); 5298#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5297#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5295#L574-1 assume 1 == ~wl_pc~0; 5293#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5289#L587 assume !(1 == ~c1_pc~0); 5286#L597 assume !(1 == ~c2_pc~0); 5288#L606 assume !(1 == ~wb_pc~0); 5680#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 5277#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5278#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5660#L634-1 assume !(1 == ~e_g~0); 5462#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 5659#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5730#L649-1 assume 0 == ~wl_st~0; 5196#L666-1 [2018-11-22 22:09:19,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2018-11-22 22:09:19,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:19,970 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-22 22:09:19,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:19,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:09:19,970 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:19,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1467526129, now seen corresponding path program 1 times [2018-11-22 22:09:19,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:20,087 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:20,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:20,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:20,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:20,087 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:09:20,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:20,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:20,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:20,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-22 22:09:20,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:20,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:20,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:20,285 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:20,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:20,294 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:20,294 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:20,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:20,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:20,311 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:20,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:20,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:20,328 INFO L448 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_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:20,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:20,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:20,347 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:20,362 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:20,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:09:20,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:20,382 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:09:20,395 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:20,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:20,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:20,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:20,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:09:20,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:20,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:20,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:20,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-22 22:09:20,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:20,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:20,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,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-22 22:09:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,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-22 22:09:20,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-22 22:09:20,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:20,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:20,589 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:09:20,589 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-22 22:09:20,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:20,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:20,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:20,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:20,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:20,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:20,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:20,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:20,591 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-22 22:09:20,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:20,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:20,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:20,592 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:20,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:20,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:20,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:20,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:20,594 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-22 22:09:20,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:20,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:20,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:20,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:20,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:20,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:20,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:20,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:20,597 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-22 22:09:20,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:20,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:20,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:20,597 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:20,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:20,598 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:20,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:20,599 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-22 22:09:20,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:20,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:20,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:20,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:20,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:20,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:20,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:20,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:09:20,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:09:20,604 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:09:20,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:09:20,604 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:09:20,604 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:09:20,605 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-22 22:09:20,605 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:09:20,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:20,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:20,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:20,657 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-22 22:09:20,658 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-22 22:09:20,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776 Second operand 5 states. [2018-11-22 22:09:20,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776. Second operand 5 states. Result 1849 states and 3132 transitions. Complement of second has 5 states. [2018-11-22 22:09:20,706 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-22 22:09:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:09:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2018-11-22 22:09:20,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 28 letters. [2018-11-22 22:09:20,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:20,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 52 letters. Loop has 28 letters. [2018-11-22 22:09:20,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:20,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 56 letters. [2018-11-22 22:09:20,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:20,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1849 states and 3132 transitions. [2018-11-22 22:09:20,720 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2018-11-22 22:09:20,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1849 states to 1849 states and 3132 transitions. [2018-11-22 22:09:20,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2018-11-22 22:09:20,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2018-11-22 22:09:20,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 3132 transitions. [2018-11-22 22:09:20,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:20,730 INFO L705 BuchiCegarLoop]: Abstraction has 1849 states and 3132 transitions. [2018-11-22 22:09:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 3132 transitions. [2018-11-22 22:09:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 955. [2018-11-22 22:09:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-22 22:09:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1615 transitions. [2018-11-22 22:09:20,752 INFO L728 BuchiCegarLoop]: Abstraction has 955 states and 1615 transitions. [2018-11-22 22:09:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:09:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:09:20,753 INFO L87 Difference]: Start difference. First operand 955 states and 1615 transitions. Second operand 4 states. [2018-11-22 22:09:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:20,829 INFO L93 Difference]: Finished difference Result 977 states and 1626 transitions. [2018-11-22 22:09:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:09:20,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1626 transitions. [2018-11-22 22:09:20,834 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2018-11-22 22:09:20,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1626 transitions. [2018-11-22 22:09:20,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2018-11-22 22:09:20,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2018-11-22 22:09:20,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1626 transitions. [2018-11-22 22:09:20,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:20,840 INFO L705 BuchiCegarLoop]: Abstraction has 977 states and 1626 transitions. [2018-11-22 22:09:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1626 transitions. [2018-11-22 22:09:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 894. [2018-11-22 22:09:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-22 22:09:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1493 transitions. [2018-11-22 22:09:20,854 INFO L728 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2018-11-22 22:09:20,855 INFO L608 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2018-11-22 22:09:20,855 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 22:09:20,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1493 transitions. [2018-11-22 22:09:20,860 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2018-11-22 22:09:20,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:20,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:20,861 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-22 22:09:20,861 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] [2018-11-22 22:09:20,861 INFO L794 eck$LassoCheckResult]: Stem: 10007#ULTIMATE.startENTRY ~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; 9831#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9788#L398 assume !(1 == ~c_req_up~0); 9790#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9801#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9802#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9954#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9955#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9995#L429-1 assume !(0 == ~e_f~0); 10039#L434-1 assume !(0 == ~e_g~0); 10040#L439-1 assume !(0 == ~e_e~0); 9946#L444-1 assume !(0 == ~e_c~0); 9947#L449-1 assume !(0 == ~e_wl~0); 10014#L454-1 assume !(1 == ~wl_pc~0); 10015#L466 assume !(2 == ~wl_pc~0); 10038#L467 assume !(1 == ~c1_pc~0); 10037#L477 assume !(1 == ~c2_pc~0); 9850#L486 assume !(1 == ~wb_pc~0); 9851#L495 assume !(1 == ~e_c~0); 10032#L504-1 assume !(1 == ~e_e~0); 10012#L509-1 assume !(1 == ~e_f~0); 10013#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10035#L519-1 assume !(1 == ~e_c~0); 9928#L524-1 assume !(1 == ~e_wl~0); 9929#L666-1 assume !false; 10456#L536 [2018-11-22 22:09:20,861 INFO L796 eck$LassoCheckResult]: Loop: 10456#L536 start_simulation_~kernel_st~0 := 1;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; 10532#L371 assume !false; 10531#L289 assume !(0 == ~wl_st~0); 10530#L293 assume !(0 == ~c1_st~0); 10529#L296 assume !(0 == ~c2_st~0); 10528#L299 assume !(0 == ~wb_st~0); 10527#L302 assume !(0 == ~r_st~0); 10526#L387 start_simulation_~kernel_st~0 := 2; 10441#L542 assume !(1 == ~c_req_up~0); 9940#L542-2 start_simulation_~kernel_st~0 := 3; 9963#L554 assume !(0 == ~e_f~0); 9932#L554-2 assume !(0 == ~e_g~0); 9933#L559-1 assume !(0 == ~e_e~0); 9981#L564-1 assume !(0 == ~e_c~0); 10008#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9844#L574-1 assume 1 == ~wl_pc~0; 9845#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 9810#L587 assume !(1 == ~c1_pc~0); 9960#L597 assume !(1 == ~c2_pc~0); 9889#L606 assume !(1 == ~wb_pc~0); 9896#L615 assume !(1 == ~e_c~0); 9897#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10041#L629-1 assume !(1 == ~e_f~0); 10499#L634-1 assume !(1 == ~e_g~0); 9918#L639-1 assume !(1 == ~e_c~0); 10542#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10539#L649-1 assume 0 == ~wl_st~0; 10535#L666-1 assume !false; 10456#L536 [2018-11-22 22:09:20,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2018-11-22 22:09:20,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:20,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:20,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-22 22:09:20,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:20,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:09:20,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:20,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash -311766517, now seen corresponding path program 1 times [2018-11-22 22:09:20,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:20,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:20,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:20,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:20,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:21,014 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:21,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:21,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:21,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:21,014 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:09:21,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:21,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:21,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-22 22:09:21,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:21,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:21,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:21,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:21,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,239 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/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-22 22:09:21,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,267 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,302 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,337 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,337 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,352 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_g~0=7} Honda state: {~e_g~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,390 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:09:21,390 INFO L448 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_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:09:21,407 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:09:21,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:09:21,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:09:21,447 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:09:21,447 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:09:21,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:09:21,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:09:21,447 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:09:21,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:09:21,448 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:09:21,448 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:09:21,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-22 22:09:21,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:09:21,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:09:21,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,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-22 22:09:21,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,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-22 22:09:21,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-22 22:09:21,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-22 22:09:21,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-22 22:09:21,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,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-22 22:09:21,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,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-22 22:09:21,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-22 22:09:21,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-22 22:09:21,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:09:21,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:09:21,674 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:09:21,674 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-22 22:09:21,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:21,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:21,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,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-22 22:09:21,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,677 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,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-22 22:09:21,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:21,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:21,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,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-22 22:09:21,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:21,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:21,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,682 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-22 22:09:21,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,682 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,684 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-22 22:09:21,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,684 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,686 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-22 22:09:21,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,688 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-22 22:09:21,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,688 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,690 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-22 22:09:21,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,693 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-22 22:09:21,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:09:21,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:09:21,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:09:21,695 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-22 22:09:21,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:09:21,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:09:21,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:09:21,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:09:21,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:09:21,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:09:21,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:09:21,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:09:21,699 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:09:21,700 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:09:21,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:09:21,700 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:09:21,700 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:09:21,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2018-11-22 22:09:21,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:09:21,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:21,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:21,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:09:21,757 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-22 22:09:21,757 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-22 22:09:21,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608 Second operand 4 states. [2018-11-22 22:09:21,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608. Second operand 4 states. Result 2509 states and 4176 transitions. Complement of second has 5 states. [2018-11-22 22:09:21,795 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-22 22:09:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:09:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-22 22:09:21,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 28 letters. [2018-11-22 22:09:21,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:21,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 28 letters. [2018-11-22 22:09:21,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:21,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 56 letters. [2018-11-22 22:09:21,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:09:21,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2509 states and 4176 transitions. [2018-11-22 22:09:21,804 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2018-11-22 22:09:21,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2509 states to 2509 states and 4176 transitions. [2018-11-22 22:09:21,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2018-11-22 22:09:21,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2018-11-22 22:09:21,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 4176 transitions. [2018-11-22 22:09:21,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:21,813 INFO L705 BuchiCegarLoop]: Abstraction has 2509 states and 4176 transitions. [2018-11-22 22:09:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 4176 transitions. [2018-11-22 22:09:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2488. [2018-11-22 22:09:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-11-22 22:09:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4141 transitions. [2018-11-22 22:09:21,836 INFO L728 BuchiCegarLoop]: Abstraction has 2488 states and 4141 transitions. [2018-11-22 22:09:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:09:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:09:21,836 INFO L87 Difference]: Start difference. First operand 2488 states and 4141 transitions. Second operand 4 states. [2018-11-22 22:09:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:21,896 INFO L93 Difference]: Finished difference Result 3187 states and 5219 transitions. [2018-11-22 22:09:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:09:21,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3187 states and 5219 transitions. [2018-11-22 22:09:21,906 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2018-11-22 22:09:21,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3187 states to 3187 states and 5219 transitions. [2018-11-22 22:09:21,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-22 22:09:21,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-22 22:09:21,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3187 states and 5219 transitions. [2018-11-22 22:09:21,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:21,916 INFO L705 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-22 22:09:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states and 5219 transitions. [2018-11-22 22:09:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2018-11-22 22:09:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2018-11-22 22:09:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5219 transitions. [2018-11-22 22:09:21,945 INFO L728 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-22 22:09:21,945 INFO L608 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2018-11-22 22:09:21,945 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 22:09:21,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3187 states and 5219 transitions. [2018-11-22 22:09:21,951 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2018-11-22 22:09:21,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:21,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:21,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:21,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:21,952 INFO L794 eck$LassoCheckResult]: Stem: 19290#ULTIMATE.startENTRY ~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; 19102#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 19055#L398 assume !(1 == ~c_req_up~0); 19057#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19062#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19063#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19222#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19223#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19271#L429-1 assume !(0 == ~e_f~0); 19344#L434-1 assume !(0 == ~e_g~0); 19147#L439-1 assume !(0 == ~e_e~0); 19148#L444-1 assume !(0 == ~e_c~0); 19343#L449-1 assume !(0 == ~e_wl~0); 19298#L454-1 assume !(1 == ~wl_pc~0); 19207#L466 assume !(2 == ~wl_pc~0); 19208#L467 assume !(1 == ~c1_pc~0); 19324#L477 assume !(1 == ~c2_pc~0); 19336#L486 assume !(1 == ~wb_pc~0); 19317#L495 assume !(1 == ~e_c~0); 19262#L504-1 assume !(1 == ~e_e~0); 19263#L509-1 assume !(1 == ~e_f~0); 19322#L514-1 assume !(1 == ~e_g~0); 19120#L519-1 assume !(1 == ~e_c~0); 19121#L524-1 assume !(1 == ~e_wl~0); 19425#L666-1 assume !false; 19426#L536 start_simulation_~kernel_st~0 := 1;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; 20838#L371 [2018-11-22 22:09:21,953 INFO L796 eck$LassoCheckResult]: Loop: 20838#L371 assume !false; 21690#L289 assume 0 == ~wl_st~0; 21685#L302-1 assume !(0 == ~wl_st~0); 21679#L311 assume !(0 == ~c1_st~0); 21676#L326 assume !(0 == ~c2_st~0); 21667#L341 assume !(0 == ~wb_st~0); 21664#L356 assume !(0 == ~r_st~0); 20838#L371 [2018-11-22 22:09:21,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2018-11-22 22:09:21,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:21,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 117964263, now seen corresponding path program 1 times [2018-11-22 22:09:21,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:21,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:21,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:21,972 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-22 22:09:21,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:21,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:21,973 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:09:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:21,973 INFO L87 Difference]: Start difference. First operand 3187 states and 5219 transitions. cyclomatic complexity: 2068 Second operand 3 states. [2018-11-22 22:09:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:22,016 INFO L93 Difference]: Finished difference Result 4973 states and 7999 transitions. [2018-11-22 22:09:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:22,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4973 states and 7999 transitions. [2018-11-22 22:09:22,031 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2018-11-22 22:09:22,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4973 states to 4973 states and 7999 transitions. [2018-11-22 22:09:22,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2018-11-22 22:09:22,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2018-11-22 22:09:22,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4973 states and 7999 transitions. [2018-11-22 22:09:22,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:22,045 INFO L705 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-22 22:09:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states and 7999 transitions. [2018-11-22 22:09:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4973. [2018-11-22 22:09:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2018-11-22 22:09:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7999 transitions. [2018-11-22 22:09:22,088 INFO L728 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-22 22:09:22,088 INFO L608 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2018-11-22 22:09:22,089 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 22:09:22,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4973 states and 7999 transitions. [2018-11-22 22:09:22,097 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2018-11-22 22:09:22,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:22,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:22,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,098 INFO L794 eck$LassoCheckResult]: Stem: 27454#ULTIMATE.startENTRY ~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; 27270#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 27221#L398 assume !(1 == ~c_req_up~0); 27223#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 27228#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 27229#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 27385#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 27386#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 27435#L429-1 assume !(0 == ~e_f~0); 27509#L434-1 assume !(0 == ~e_g~0); 27311#L439-1 assume !(0 == ~e_e~0); 27312#L444-1 assume !(0 == ~e_c~0); 27508#L449-1 assume !(0 == ~e_wl~0); 27461#L454-1 assume !(1 == ~wl_pc~0); 27373#L466 assume !(2 == ~wl_pc~0); 27374#L467 assume !(1 == ~c1_pc~0); 27488#L477 assume !(1 == ~c2_pc~0); 27501#L486 assume !(1 == ~wb_pc~0); 27483#L495 assume !(1 == ~e_c~0); 27426#L504-1 assume !(1 == ~e_e~0); 27427#L509-1 assume !(1 == ~e_f~0); 27486#L514-1 assume !(1 == ~e_g~0); 27286#L519-1 assume !(1 == ~e_c~0); 27287#L524-1 assume !(1 == ~e_wl~0); 27360#L666-1 assume !false; 28735#L536 start_simulation_~kernel_st~0 := 1;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; 30068#L371 [2018-11-22 22:09:22,098 INFO L796 eck$LassoCheckResult]: Loop: 30068#L371 assume !false; 31131#L289 assume 0 == ~wl_st~0; 31003#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31120#L315 assume !(0 != eval_~tmp~0); 31129#L311 assume !(0 == ~c1_st~0); 31161#L326 assume !(0 == ~c2_st~0); 31147#L341 assume !(0 == ~wb_st~0); 31140#L356 assume !(0 == ~r_st~0); 30068#L371 [2018-11-22 22:09:22,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2018-11-22 22:09:22,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1280783410, now seen corresponding path program 1 times [2018-11-22 22:09:22,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:22,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 361828906, now seen corresponding path program 1 times [2018-11-22 22:09:22,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:22,133 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-22 22:09:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:22,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:22,172 INFO L87 Difference]: Start difference. First operand 4973 states and 7999 transitions. cyclomatic complexity: 3062 Second operand 3 states. [2018-11-22 22:09:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:22,198 INFO L93 Difference]: Finished difference Result 7644 states and 12212 transitions. [2018-11-22 22:09:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:22,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7644 states and 12212 transitions. [2018-11-22 22:09:22,215 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2018-11-22 22:09:22,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7644 states to 7644 states and 12212 transitions. [2018-11-22 22:09:22,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3054 [2018-11-22 22:09:22,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3054 [2018-11-22 22:09:22,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7644 states and 12212 transitions. [2018-11-22 22:09:22,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:22,244 INFO L705 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-22 22:09:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7644 states and 12212 transitions. [2018-11-22 22:09:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7644 to 7644. [2018-11-22 22:09:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2018-11-22 22:09:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12212 transitions. [2018-11-22 22:09:22,310 INFO L728 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-22 22:09:22,310 INFO L608 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2018-11-22 22:09:22,310 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 22:09:22,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7644 states and 12212 transitions. [2018-11-22 22:09:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2018-11-22 22:09:22,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:22,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:22,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,323 INFO L794 eck$LassoCheckResult]: Stem: 40073#ULTIMATE.startENTRY ~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; 39895#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 39846#L398 assume !(1 == ~c_req_up~0); 39848#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 39853#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 39854#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 40014#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 40015#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 40056#L429-1 assume !(0 == ~e_f~0); 40131#L434-1 assume !(0 == ~e_g~0); 39938#L439-1 assume !(0 == ~e_e~0); 39939#L444-1 assume !(0 == ~e_c~0); 40130#L449-1 assume !(0 == ~e_wl~0); 40080#L454-1 assume !(1 == ~wl_pc~0); 40001#L466 assume !(2 == ~wl_pc~0); 40002#L467 assume !(1 == ~c1_pc~0); 40108#L477 assume !(1 == ~c2_pc~0); 40123#L486 assume !(1 == ~wb_pc~0); 40101#L495 assume !(1 == ~e_c~0); 40045#L504-1 assume !(1 == ~e_e~0); 40046#L509-1 assume !(1 == ~e_f~0); 40105#L514-1 assume !(1 == ~e_g~0); 39912#L519-1 assume !(1 == ~e_c~0); 39913#L524-1 assume !(1 == ~e_wl~0); 39988#L666-1 assume !false; 42263#L536 start_simulation_~kernel_st~0 := 1;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; 45127#L371 [2018-11-22 22:09:22,323 INFO L796 eck$LassoCheckResult]: Loop: 45127#L371 assume !false; 47432#L289 assume 0 == ~wl_st~0; 40114#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 39963#L315 assume !(0 != eval_~tmp~0); 39964#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 45144#L330 assume !(0 != eval_~tmp___0~0); 45143#L326 assume !(0 == ~c2_st~0); 45131#L341 assume !(0 == ~wb_st~0); 45128#L356 assume !(0 == ~r_st~0); 45127#L371 [2018-11-22 22:09:22,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2018-11-22 22:09:22,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 1 times [2018-11-22 22:09:22,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1718978040, now seen corresponding path program 1 times [2018-11-22 22:09:22,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:22,357 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-22 22:09:22,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:22,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:22,385 INFO L87 Difference]: Start difference. First operand 7644 states and 12212 transitions. cyclomatic complexity: 4604 Second operand 3 states. [2018-11-22 22:09:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:22,427 INFO L93 Difference]: Finished difference Result 12085 states and 19155 transitions. [2018-11-22 22:09:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:22,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12085 states and 19155 transitions. [2018-11-22 22:09:22,453 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-22 22:09:22,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12085 states to 12085 states and 19155 transitions. [2018-11-22 22:09:22,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2018-11-22 22:09:22,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2018-11-22 22:09:22,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12085 states and 19155 transitions. [2018-11-22 22:09:22,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:22,520 INFO L705 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-22 22:09:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12085 states and 19155 transitions. [2018-11-22 22:09:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 12085. [2018-11-22 22:09:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12085 states. [2018-11-22 22:09:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12085 states to 12085 states and 19155 transitions. [2018-11-22 22:09:22,611 INFO L728 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-22 22:09:22,611 INFO L608 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2018-11-22 22:09:22,611 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 22:09:22,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12085 states and 19155 transitions. [2018-11-22 22:09:22,631 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-22 22:09:22,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:22,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:22,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,631 INFO L794 eck$LassoCheckResult]: Stem: 59828#ULTIMATE.startENTRY ~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; 59630#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 59583#L398 assume !(1 == ~c_req_up~0); 59585#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 59590#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 59591#L414-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 59916#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 59805#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 59806#L429-1 assume !(0 == ~e_f~0); 59911#L434-1 assume !(0 == ~e_g~0); 59912#L439-1 assume !(0 == ~e_e~0); 59908#L444-1 assume !(0 == ~e_c~0); 59909#L449-1 assume !(0 == ~e_wl~0); 59835#L454-1 assume !(1 == ~wl_pc~0); 59836#L466 assume !(2 == ~wl_pc~0); 59873#L467 assume !(1 == ~c1_pc~0); 59872#L477 assume !(1 == ~c2_pc~0); 59894#L486 assume !(1 == ~wb_pc~0); 59893#L495 assume !(1 == ~e_c~0); 59797#L504-1 assume !(1 == ~e_e~0); 59798#L509-1 assume !(1 == ~e_f~0); 59868#L514-1 assume !(1 == ~e_g~0); 59869#L519-1 assume !(1 == ~e_c~0); 63968#L524-1 assume !(1 == ~e_wl~0); 63963#L666-1 assume !false; 63964#L536 start_simulation_~kernel_st~0 := 1;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; 67491#L371 [2018-11-22 22:09:22,631 INFO L796 eck$LassoCheckResult]: Loop: 67491#L371 assume !false; 67695#L289 assume 0 == ~wl_st~0; 67682#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 67675#L315 assume !(0 != eval_~tmp~0); 67689#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 67708#L330 assume !(0 != eval_~tmp___0~0); 67706#L326 assume !(0 == ~c2_st~0); 67703#L341 assume !(0 == ~wb_st~0); 67700#L356 assume !(0 == ~r_st~0); 67491#L371 [2018-11-22 22:09:22,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2018-11-22 22:09:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:22,648 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-22 22:09:22,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:22,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:22,649 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:09:22,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 2 times [2018-11-22 22:09:22,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:22,692 INFO L87 Difference]: Start difference. First operand 12085 states and 19155 transitions. cyclomatic complexity: 7106 Second operand 3 states. [2018-11-22 22:09:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:22,716 INFO L93 Difference]: Finished difference Result 12033 states and 19068 transitions. [2018-11-22 22:09:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:22,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12033 states and 19068 transitions. [2018-11-22 22:09:22,743 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-22 22:09:22,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12033 states to 12033 states and 19068 transitions. [2018-11-22 22:09:22,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4810 [2018-11-22 22:09:22,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4810 [2018-11-22 22:09:22,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12033 states and 19068 transitions. [2018-11-22 22:09:22,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:22,770 INFO L705 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-22 22:09:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states and 19068 transitions. [2018-11-22 22:09:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12033. [2018-11-22 22:09:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12033 states. [2018-11-22 22:09:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 19068 transitions. [2018-11-22 22:09:22,859 INFO L728 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-22 22:09:22,859 INFO L608 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2018-11-22 22:09:22,859 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-22 22:09:22,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12033 states and 19068 transitions. [2018-11-22 22:09:22,879 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2018-11-22 22:09:22,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:22,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:22,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:22,880 INFO L794 eck$LassoCheckResult]: Stem: 83946#ULTIMATE.startENTRY ~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; 83750#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 83707#L398 assume !(1 == ~c_req_up~0); 83709#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 83714#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 83715#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 83877#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 83878#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 83924#L429-1 assume !(0 == ~e_f~0); 84009#L434-1 assume !(0 == ~e_g~0); 83802#L439-1 assume !(0 == ~e_e~0); 83803#L444-1 assume !(0 == ~e_c~0); 84008#L449-1 assume !(0 == ~e_wl~0); 83954#L454-1 assume !(1 == ~wl_pc~0); 83864#L466 assume !(2 == ~wl_pc~0); 83865#L467 assume !(1 == ~c1_pc~0); 83984#L477 assume !(1 == ~c2_pc~0); 84001#L486 assume !(1 == ~wb_pc~0); 83978#L495 assume !(1 == ~e_c~0); 83915#L504-1 assume !(1 == ~e_e~0); 83916#L509-1 assume !(1 == ~e_f~0); 83982#L514-1 assume !(1 == ~e_g~0); 83775#L519-1 assume !(1 == ~e_c~0); 83776#L524-1 assume !(1 == ~e_wl~0); 83851#L666-1 assume !false; 86384#L536 start_simulation_~kernel_st~0 := 1;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; 91989#L371 [2018-11-22 22:09:22,880 INFO L796 eck$LassoCheckResult]: Loop: 91989#L371 assume !false; 91753#L289 assume 0 == ~wl_st~0; 91748#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91686#L315 assume !(0 != eval_~tmp~0); 91590#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91588#L330 assume !(0 != eval_~tmp___0~0); 91586#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91571#L345 assume !(0 != eval_~tmp___1~0); 91581#L341 assume !(0 == ~wb_st~0); 91992#L356 assume !(0 == ~r_st~0); 91989#L371 [2018-11-22 22:09:22,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2018-11-22 22:09:22,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 896651005, now seen corresponding path program 1 times [2018-11-22 22:09:22,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1750331659, now seen corresponding path program 1 times [2018-11-22 22:09:22,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:09:22,909 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-22 22:09:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:09:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:09:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:09:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:09:22,943 INFO L87 Difference]: Start difference. First operand 12033 states and 19068 transitions. cyclomatic complexity: 7071 Second operand 3 states. [2018-11-22 22:09:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:09:23,002 INFO L93 Difference]: Finished difference Result 18669 states and 29460 transitions. [2018-11-22 22:09:23,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:09:23,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18669 states and 29460 transitions. [2018-11-22 22:09:23,044 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7424 [2018-11-22 22:09:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18669 states to 18669 states and 29460 transitions. [2018-11-22 22:09:23,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7496 [2018-11-22 22:09:23,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7496 [2018-11-22 22:09:23,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18669 states and 29460 transitions. [2018-11-22 22:09:23,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:09:23,096 INFO L705 BuchiCegarLoop]: Abstraction has 18669 states and 29460 transitions. [2018-11-22 22:09:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18669 states and 29460 transitions. [2018-11-22 22:09:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18669 to 18549. [2018-11-22 22:09:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2018-11-22 22:09:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 29340 transitions. [2018-11-22 22:09:23,317 INFO L728 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2018-11-22 22:09:23,317 INFO L608 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2018-11-22 22:09:23,317 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-22 22:09:23,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18549 states and 29340 transitions. [2018-11-22 22:09:23,346 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7376 [2018-11-22 22:09:23,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:09:23,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:09:23,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:23,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:09:23,347 INFO L794 eck$LassoCheckResult]: Stem: 114662#ULTIMATE.startENTRY ~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; 114464#L-1 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 114417#L398 assume !(1 == ~c_req_up~0); 114419#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 114424#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 114425#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 114584#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 114585#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 114635#L429-1 assume !(0 == ~e_f~0); 114737#L434-1 assume !(0 == ~e_g~0); 114508#L439-1 assume !(0 == ~e_e~0); 114509#L444-1 assume !(0 == ~e_c~0); 114736#L449-1 assume !(0 == ~e_wl~0); 114671#L454-1 assume !(1 == ~wl_pc~0); 114571#L466 assume !(2 == ~wl_pc~0); 114572#L467 assume !(1 == ~c1_pc~0); 114710#L477 assume !(1 == ~c2_pc~0); 114729#L486 assume !(1 == ~wb_pc~0); 114703#L495 assume !(1 == ~e_c~0); 114627#L504-1 assume !(1 == ~e_e~0); 114628#L509-1 assume !(1 == ~e_f~0); 114706#L514-1 assume !(1 == ~e_g~0); 114482#L519-1 assume !(1 == ~e_c~0); 114483#L524-1 assume !(1 == ~e_wl~0); 114558#L666-1 assume !false; 120203#L536 start_simulation_~kernel_st~0 := 1;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; 127280#L371 [2018-11-22 22:09:23,347 INFO L796 eck$LassoCheckResult]: Loop: 127280#L371 assume !false; 126072#L289 assume 0 == ~wl_st~0; 126071#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 126063#L315 assume !(0 != eval_~tmp~0); 126070#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126221#L330 assume !(0 != eval_~tmp___0~0); 126219#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 126206#L345 assume !(0 != eval_~tmp___1~0); 126215#L341 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 127228#L360 assume !(0 != eval_~tmp___2~0); 127238#L356 assume !(0 == ~r_st~0); 127280#L371 [2018-11-22 22:09:23,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2018-11-22 22:09:23,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:23,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2026342965, now seen corresponding path program 1 times [2018-11-22 22:09:23,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:23,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:23,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:09:23,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:09:23,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1574259005, now seen corresponding path program 1 times [2018-11-22 22:09:23,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:09:23,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:09:23,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:09:23,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:09:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:09:23,645 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~c_req_up~0); [?] assume 1 == ~wl_i~0;~wl_st~0 := 0; [?] assume 1 == ~c1_i~0;~c1_st~0 := 0; [?] assume 1 == ~c2_i~0;~c2_st~0 := 0; [?] assume 1 == ~wb_i~0;~wb_st~0 := 0; [?] assume !(1 == ~r_i~0);~r_st~0 := 2; [?] assume !(0 == ~e_f~0); [?] assume !(0 == ~e_g~0); [?] assume !(0 == ~e_e~0); [?] assume !(0 == ~e_c~0); [?] assume !(0 == ~e_wl~0); [?] assume !(1 == ~wl_pc~0); [?] assume !(2 == ~wl_pc~0); [?] assume !(1 == ~c1_pc~0); [?] assume !(1 == ~c2_pc~0); [?] assume !(1 == ~wb_pc~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_e~0); [?] assume !(1 == ~e_f~0); [?] assume !(1 == ~e_g~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_wl~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;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; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~wl_st~0; [?] assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___1~0); [?] assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___2~0); [?] assume !(0 == ~r_st~0); [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) ----- [2018-11-22 22:09:23,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:09:23 BoogieIcfgContainer [2018-11-22 22:09:23,721 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:09:23,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:09:23,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:09:23,724 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:09:23,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:18" (3/4) ... [2018-11-22 22:09:23,727 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~c_req_up~0); [?] assume 1 == ~wl_i~0;~wl_st~0 := 0; [?] assume 1 == ~c1_i~0;~c1_st~0 := 0; [?] assume 1 == ~c2_i~0;~c2_st~0 := 0; [?] assume 1 == ~wb_i~0;~wb_st~0 := 0; [?] assume !(1 == ~r_i~0);~r_st~0 := 2; [?] assume !(0 == ~e_f~0); [?] assume !(0 == ~e_g~0); [?] assume !(0 == ~e_e~0); [?] assume !(0 == ~e_c~0); [?] assume !(0 == ~e_wl~0); [?] assume !(1 == ~wl_pc~0); [?] assume !(2 == ~wl_pc~0); [?] assume !(1 == ~c1_pc~0); [?] assume !(1 == ~c2_pc~0); [?] assume !(1 == ~wb_pc~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_e~0); [?] assume !(1 == ~e_f~0); [?] assume !(1 == ~e_g~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_wl~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;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; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~wl_st~0; [?] assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___1~0); [?] assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___2~0); [?] assume !(0 == ~r_st~0); [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) ----- [2018-11-22 22:09:23,869 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_07f9f89a-531f-4ad2-b655-9774f3907793/bin-2019/uautomizer/witness.graphml [2018-11-22 22:09:23,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:09:23,870 INFO L168 Benchmark]: Toolchain (without parser) took 6574.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 961.9 MB in the beginning and 950.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 249.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,870 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:09:23,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.10 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 940.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,871 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:09:23,871 INFO L168 Benchmark]: RCFGBuilder took 425.07 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,872 INFO L168 Benchmark]: BuchiAutomizer took 5685.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 138.1 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,875 INFO L168 Benchmark]: Witness Printer took 148.12 ms. Allocated memory is still 1.3 GB. Free memory was 957.9 MB in the beginning and 950.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:09:23,877 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.10 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 940.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.07 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5685.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 138.1 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. * Witness Printer took 148.12 ms. Allocated memory is still 1.3 GB. Free memory was 957.9 MB in the beginning and 950.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_e + 3 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 18549 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1274 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 18549 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4151 SDtfs, 4004 SDslu, 2207 SDs, 0 SdLazy, 345 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 288]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6deeedc8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c37dde=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43331263=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5984b900=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@638bd96f=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 288]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~c_req_up~0); [?] assume 1 == ~wl_i~0;~wl_st~0 := 0; [?] assume 1 == ~c1_i~0;~c1_st~0 := 0; [?] assume 1 == ~c2_i~0;~c2_st~0 := 0; [?] assume 1 == ~wb_i~0;~wb_st~0 := 0; [?] assume !(1 == ~r_i~0);~r_st~0 := 2; [?] assume !(0 == ~e_f~0); [?] assume !(0 == ~e_g~0); [?] assume !(0 == ~e_e~0); [?] assume !(0 == ~e_c~0); [?] assume !(0 == ~e_wl~0); [?] assume !(1 == ~wl_pc~0); [?] assume !(2 == ~wl_pc~0); [?] assume !(1 == ~c1_pc~0); [?] assume !(1 == ~c2_pc~0); [?] assume !(1 == ~wb_pc~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_e~0); [?] assume !(1 == ~e_f~0); [?] assume !(1 == ~e_g~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_wl~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;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; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~wl_st~0; [?] assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___1~0); [?] assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___2~0); [?] assume !(0 == ~r_st~0); [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~c_req_up~0); [?] assume 1 == ~wl_i~0;~wl_st~0 := 0; [?] assume 1 == ~c1_i~0;~c1_st~0 := 0; [?] assume 1 == ~c2_i~0;~c2_st~0 := 0; [?] assume 1 == ~wb_i~0;~wb_st~0 := 0; [?] assume !(1 == ~r_i~0);~r_st~0 := 2; [?] assume !(0 == ~e_f~0); [?] assume !(0 == ~e_g~0); [?] assume !(0 == ~e_e~0); [?] assume !(0 == ~e_c~0); [?] assume !(0 == ~e_wl~0); [?] assume !(1 == ~wl_pc~0); [?] assume !(2 == ~wl_pc~0); [?] assume !(1 == ~c1_pc~0); [?] assume !(1 == ~c2_pc~0); [?] assume !(1 == ~wb_pc~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_e~0); [?] assume !(1 == ~e_f~0); [?] assume !(1 == ~e_g~0); [?] assume !(1 == ~e_c~0); [?] assume !(1 == ~e_wl~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;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; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398-L408] assume !(1 == ~c_req_up~0); [L409-L413] assume 1 == ~wl_i~0; [L410] ~wl_st~0 := 0; [L414-L418] assume 1 == ~c1_i~0; [L415] ~c1_st~0 := 0; [L419-L423] assume 1 == ~c2_i~0; [L420] ~c2_st~0 := 0; [L424-L428] assume 1 == ~wb_i~0; [L425] ~wb_st~0 := 0; [L429-L433] assume !(1 == ~r_i~0); [L432] ~r_st~0 := 2; [L434-L438] assume !(0 == ~e_f~0); [L439-L443] assume !(0 == ~e_g~0); [L444-L448] assume !(0 == ~e_e~0); [L449-L453] assume !(0 == ~e_c~0); [L454-L458] assume !(0 == ~e_wl~0); [L459-L476] assume !(1 == ~wl_pc~0); [L467-L475] assume !(2 == ~wl_pc~0); [L477-L485] assume !(1 == ~c1_pc~0); [L486-L494] assume !(1 == ~c2_pc~0); [L495-L503] assume !(1 == ~wb_pc~0); [L504-L508] assume !(1 == ~e_c~0); [L509-L513] assume !(1 == ~e_e~0); [L514-L518] assume !(1 == ~e_f~0); [L519-L523] assume !(1 == ~e_g~0); [L524-L528] assume !(1 == ~e_c~0); [L529-L533] assume !(1 == ~e_wl~0); [L535-L675] assume !false; [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L683] havoc main_~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L704] havoc start_simulation_~kernel_st~0; [L394] havoc start_simulation_~kernel_st~0; [L397] start_simulation_~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] start_simulation_~kernel_st~0 := 1; [L539] 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; [L280] havoc eval_~tmp~0; [L281] havoc eval_~tmp___0~0; [L282] havoc eval_~tmp___1~0; [L283] havoc eval_~tmp___2~0; [L284] havoc eval_~tmp___3~0; [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] ~c~0 := 0; [L19] ~c_t~0 := 0; [L20] ~c_req_up~0 := 0; [L21] ~p_in~0 := 0; [L22] ~p_out~0 := 0; [L23] ~wl_st~0 := 0; [L24] ~c1_st~0 := 0; [L25] ~c2_st~0 := 0; [L26] ~wb_st~0 := 0; [L27] ~r_st~0 := 0; [L28] ~wl_i~0 := 0; [L29] ~c1_i~0 := 0; [L30] ~c2_i~0 := 0; [L31] ~wb_i~0 := 0; [L32] ~r_i~0 := 0; [L33] ~wl_pc~0 := 0; [L34] ~c1_pc~0 := 0; [L35] ~c2_pc~0 := 0; [L36] ~wb_pc~0 := 0; [L37] ~e_e~0 := 0; [L38] ~e_f~0 := 0; [L39] ~e_g~0 := 0; [L40] ~e_c~0 := 0; [L41] ~e_p_in~0 := 0; [L42] ~e_wl~0 := 0; [L48] ~d~0 := 0; [L49] ~data~0 := 0; [L50] ~processed~0 := 0; [L51] ~t_b~0 := 0; [L683] havoc ~__retres1~0; [L687] ~e_wl~0 := 2; [L688] ~e_c~0 := ~e_wl~0; [L689] ~e_g~0 := ~e_c~0; [L690] ~e_f~0 := ~e_g~0; [L691] ~e_e~0 := ~e_f~0; [L692] ~wl_pc~0 := 0; [L693] ~c1_pc~0 := 0; [L694] ~c2_pc~0 := 0; [L695] ~wb_pc~0 := 0; [L696] ~wb_i~0 := 1; [L697] ~c2_i~0 := ~wb_i~0; [L698] ~c1_i~0 := ~c2_i~0; [L699] ~wl_i~0 := ~c1_i~0; [L700] ~r_i~0 := 0; [L701] ~c_req_up~0 := 0; [L702] ~d~0 := 0; [L703] ~c~0 := 0; [L394] havoc ~kernel_st~0; [L397] ~kernel_st~0 := 0; [L398] COND FALSE !(1 == ~c_req_up~0) [L409] COND TRUE 1 == ~wl_i~0 [L410] ~wl_st~0 := 0; [L414] COND TRUE 1 == ~c1_i~0 [L415] ~c1_st~0 := 0; [L419] COND TRUE 1 == ~c2_i~0 [L420] ~c2_st~0 := 0; [L424] COND TRUE 1 == ~wb_i~0 [L425] ~wb_st~0 := 0; [L429] COND FALSE !(1 == ~r_i~0) [L432] ~r_st~0 := 2; [L434] COND FALSE !(0 == ~e_f~0) [L439] COND FALSE !(0 == ~e_g~0) [L444] COND FALSE !(0 == ~e_e~0) [L449] COND FALSE !(0 == ~e_c~0) [L454] COND FALSE !(0 == ~e_wl~0) [L459] COND FALSE !(1 == ~wl_pc~0) [L467] COND FALSE !(2 == ~wl_pc~0) [L477] COND FALSE !(1 == ~c1_pc~0) [L486] COND FALSE !(1 == ~c2_pc~0) [L495] COND FALSE !(1 == ~wb_pc~0) [L504] COND FALSE !(1 == ~e_c~0) [L509] COND FALSE !(1 == ~e_e~0) [L514] COND FALSE !(1 == ~e_f~0) [L519] COND FALSE !(1 == ~e_g~0) [L524] COND FALSE !(1 == ~e_c~0) [L529] COND FALSE !(1 == ~e_wl~0) [L535-L675] COND FALSE !(false) [L538] ~kernel_st~0 := 1; [L280] havoc ~tmp~0; [L281] havoc ~tmp___0~0; [L282] havoc ~tmp___1~0; [L283] havoc ~tmp___2~0; [L284] havoc ~tmp___3~0; [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~wl_st~0; [?] assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___1~0); [?] assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___2~0); [?] assume !(0 == ~r_st~0); [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L288-L386] assume !false; [L290-L310] assume 0 == ~wl_st~0; [L311-L325] assume 0 == ~wl_st~0; [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] assume !(0 != eval_~tmp~0); [L326-L340] assume 0 == ~c1_st~0; [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] assume !(0 != eval_~tmp___0~0); [L341-L355] assume 0 == ~c2_st~0; [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] assume !(0 != eval_~tmp___1~0); [L356-L370] assume 0 == ~wb_st~0; [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] assume !(0 != eval_~tmp___2~0); [L371-L385] assume !(0 == ~r_st~0); [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] eval_~tmp~0 := eval_#t~nondet0; [L313] havoc eval_#t~nondet0; [L315-L322] COND FALSE !(0 != eval_~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] eval_~tmp___0~0 := eval_#t~nondet1; [L328] havoc eval_#t~nondet1; [L330-L337] COND FALSE !(0 != eval_~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] eval_~tmp___1~0 := eval_#t~nondet2; [L343] havoc eval_#t~nondet2; [L345-L352] COND FALSE !(0 != eval_~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] eval_~tmp___2~0 := eval_#t~nondet3; [L358] havoc eval_#t~nondet3; [L360-L367] COND FALSE !(0 != eval_~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L288-L386] COND FALSE !(false) [L290] COND TRUE 0 == ~wl_st~0 [L311] COND TRUE 0 == ~wl_st~0 [L313] ~tmp~0 := #t~nondet0; [L313] havoc #t~nondet0; [L315-L322] COND FALSE !(0 != ~tmp~0) [L326] COND TRUE 0 == ~c1_st~0 [L328] ~tmp___0~0 := #t~nondet1; [L328] havoc #t~nondet1; [L330-L337] COND FALSE !(0 != ~tmp___0~0) [L341] COND TRUE 0 == ~c2_st~0 [L343] ~tmp___1~0 := #t~nondet2; [L343] havoc #t~nondet2; [L345-L352] COND FALSE !(0 != ~tmp___1~0) [L356] COND TRUE 0 == ~wb_st~0 [L358] ~tmp___2~0 := #t~nondet3; [L358] havoc #t~nondet3; [L360-L367] COND FALSE !(0 != ~tmp___2~0) [L371] COND FALSE !(0 == ~r_st~0) [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; Loop: [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...