./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-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_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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 df684da5e5a56662a7be6091ec5bb0a21e1453c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-23 04:40:54,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:40:54,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:40:54,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:40:54,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:40:54,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:40:54,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:40:54,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:40:54,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:40:54,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:40:54,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:40:54,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:40:54,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:40:54,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:40:54,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:40:54,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:40:54,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:40:54,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:40:54,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:40:54,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:40:54,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:40:54,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:40:54,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:40:54,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:40:54,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:40:54,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:40:54,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:40:54,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:40:54,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:40:54,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:40:54,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:40:54,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:40:54,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:40:54,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:40:54,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:40:54,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:40:54,156 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:40:54,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:40:54,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:40:54,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:40:54,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:40:54,167 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:40:54,168 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:40:54,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:40:54,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:40:54,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:40:54,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:40:54,170 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:40:54,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:40:54,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:40:54,171 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:40:54,171 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:40:54,172 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_e5e91762-d255-4820-9f16-93afc380fbf5/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 -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2018-11-23 04:40:54,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:40:54,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:40:54,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:40:54,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:40:54,207 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:40:54,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-23 04:40:54,251 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/data/897d70d3c/e69ca87c3a0a43a28d911628398c2059/FLAG38da98011 [2018-11-23 04:40:54,612 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:40:54,613 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-23 04:40:54,678 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/data/897d70d3c/e69ca87c3a0a43a28d911628398c2059/FLAG38da98011 [2018-11-23 04:40:55,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/data/897d70d3c/e69ca87c3a0a43a28d911628398c2059 [2018-11-23 04:40:55,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:40:55,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:40:55,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:55,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:40:55,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:40:55,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d78f062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55, skipping insertion in model container [2018-11-23 04:40:55,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:40:55,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:40:55,204 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:55,207 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:40:55,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:55,246 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:40:55,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55 WrapperNode [2018-11-23 04:40:55,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:55,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:55,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:40:55,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:40:55,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:55,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:40:55,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:40:55,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:40:55,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... [2018-11-23 04:40:55,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:40:55,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:40:55,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:40:55,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:40:55,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:40:55,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:40:55,688 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:40:55,688 INFO L280 CfgBuilder]: Removed 60 assue(true) statements. [2018-11-23 04:40:55,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:55 BoogieIcfgContainer [2018-11-23 04:40:55,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:40:55,689 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:40:55,689 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:40:55,692 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:40:55,692 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:55,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:40:55" (1/3) ... [2018-11-23 04:40:55,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17f8fa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:55, skipping insertion in model container [2018-11-23 04:40:55,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:55,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:55" (2/3) ... [2018-11-23 04:40:55,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17f8fa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:55, skipping insertion in model container [2018-11-23 04:40:55,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:55,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:55" (3/3) ... [2018-11-23 04:40:55,695 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-23 04:40:55,731 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:40:55,732 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:40:55,732 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:40:55,732 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:40:55,732 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:40:55,732 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:40:55,732 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:40:55,732 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:40:55,732 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:40:55,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2018-11-23 04:40:55,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-23 04:40:55,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:55,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:55,762 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] [2018-11-23 04:40:55,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:55,763 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:40:55,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2018-11-23 04:40:55,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-23 04:40:55,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:55,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:55,768 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] [2018-11-23 04:40:55,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:55,773 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 76#L452true havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 11#L212true assume !(1 == ~q_req_up~0); 9#L212-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 43#L227-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 56#L232-1true assume !(0 == ~q_read_ev~0); 59#L265-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 22#L270-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 42#L55true assume 1 == ~p_dw_pc~0; 72#L56true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 44#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 74#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 69#L305true assume !(0 != activate_threads_~tmp~1); 75#L305-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 62#L74true assume !(1 == ~c_dr_pc~0); 32#L74-2true is_do_read_c_triggered_~__retres1~1 := 0; 63#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 91#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 77#L313true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 78#L313-2true assume !(1 == ~q_read_ev~0); 50#L283-1true assume !(1 == ~q_write_ev~0); 3#L409-1true [2018-11-23 04:40:55,773 INFO L796 eck$LassoCheckResult]: Loop: 3#L409-1true assume !false; 47#L410true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4#L354true assume false; 40#L370true start_simulation_~kernel_st~0 := 2; 7#L212-2true assume !(1 == ~q_req_up~0); 5#L212-3true start_simulation_~kernel_st~0 := 3; 57#L265-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 51#L265-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 16#L270-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12#L55-3true assume 1 == ~p_dw_pc~0; 68#L56-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 41#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 70#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 53#L305-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 58#L305-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 30#L74-3true assume 1 == ~c_dr_pc~0; 87#L75-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 34#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 88#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 80#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 61#L313-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 73#L283-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 81#L288-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13#L245-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 65#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 92#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 33#L384true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 19#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L392true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 84#L426true assume !(0 != start_simulation_~tmp~4); 3#L409-1true [2018-11-23 04:40:55,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1146955365, now seen corresponding path program 1 times [2018-11-23 04:40:55,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,870 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-23 04:40:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:55,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:55,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:55,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1868636057, now seen corresponding path program 1 times [2018-11-23 04:40:55,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,884 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-23 04:40:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:55,886 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:55,898 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2018-11-23 04:40:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:55,930 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2018-11-23 04:40:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:55,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 135 transitions. [2018-11-23 04:40:55,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 04:40:55,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 128 transitions. [2018-11-23 04:40:55,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-23 04:40:55,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-23 04:40:55,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2018-11-23 04:40:55,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:55,939 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2018-11-23 04:40:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2018-11-23 04:40:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 04:40:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 04:40:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2018-11-23 04:40:55,965 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2018-11-23 04:40:55,965 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2018-11-23 04:40:55,965 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:40:55,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 128 transitions. [2018-11-23 04:40:55,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 04:40:55,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:55,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:55,968 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] [2018-11-23 04:40:55,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:55,968 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 218#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 219#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 216#L212 assume !(1 == ~q_req_up~0); 207#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 208#L227-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 253#L232-1 assume !(0 == ~q_read_ev~0); 264#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 229#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 230#L55 assume 1 == ~p_dw_pc~0; 252#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 246#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 254#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 275#L305 assume !(0 != activate_threads_~tmp~1); 276#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 267#L74 assume !(1 == ~c_dr_pc~0); 238#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 239#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 269#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 278#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 279#L313-2 assume !(1 == ~q_read_ev~0); 256#L283-1 assume !(1 == ~q_write_ev~0); 195#L409-1 [2018-11-23 04:40:55,969 INFO L796 eck$LassoCheckResult]: Loop: 195#L409-1 assume !false; 196#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 197#L354 assume !false; 198#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 242#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 243#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 272#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 257#L334 assume !(0 != eval_~tmp___1~0); 250#L370 start_simulation_~kernel_st~0 := 2; 203#L212-2 assume !(1 == ~q_req_up~0); 199#L212-3 start_simulation_~kernel_st~0 := 3; 200#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 259#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 221#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 211#L55-3 assume 1 == ~p_dw_pc~0; 212#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 206#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 251#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 260#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 261#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 236#L74-3 assume !(1 == ~c_dr_pc~0); 233#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 234#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 241#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 280#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 265#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 266#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 277#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 213#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 215#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 240#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 223#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 224#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 249#L426 assume !(0 != start_simulation_~tmp~4); 195#L409-1 [2018-11-23 04:40:55,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1153867225, now seen corresponding path program 1 times [2018-11-23 04:40:55,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,000 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-23 04:40:56,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:56,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash 91737555, now seen corresponding path program 1 times [2018-11-23 04:40:56,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,041 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-23 04:40:56,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,042 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:56,042 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-23 04:40:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,055 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2018-11-23 04:40:56,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:56,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 127 transitions. [2018-11-23 04:40:56,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 04:40:56,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 127 transitions. [2018-11-23 04:40:56,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-23 04:40:56,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-23 04:40:56,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 127 transitions. [2018-11-23 04:40:56,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,063 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2018-11-23 04:40:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 127 transitions. [2018-11-23 04:40:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 04:40:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 04:40:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2018-11-23 04:40:56,067 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2018-11-23 04:40:56,067 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2018-11-23 04:40:56,067 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:40:56,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 127 transitions. [2018-11-23 04:40:56,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 04:40:56,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,069 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] [2018-11-23 04:40:56,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,069 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 399#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 400#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 392#L212 assume !(1 == ~q_req_up~0); 388#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 389#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 434#L232-1 assume !(0 == ~q_read_ev~0); 445#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 408#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 409#L55 assume 1 == ~p_dw_pc~0; 433#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 424#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 435#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 454#L305 assume !(0 != activate_threads_~tmp~1); 455#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 448#L74 assume !(1 == ~c_dr_pc~0); 419#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 420#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 450#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 459#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 460#L313-2 assume !(1 == ~q_read_ev~0); 437#L283-1 assume !(1 == ~q_write_ev~0); 376#L409-1 [2018-11-23 04:40:56,070 INFO L796 eck$LassoCheckResult]: Loop: 376#L409-1 assume !false; 377#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 378#L354 assume !false; 379#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 425#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 426#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 453#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 438#L334 assume !(0 != eval_~tmp___1~0); 431#L370 start_simulation_~kernel_st~0 := 2; 384#L212-2 assume !(1 == ~q_req_up~0); 380#L212-3 start_simulation_~kernel_st~0 := 3; 381#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 440#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 402#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 394#L55-3 assume !(1 == ~p_dw_pc~0); 386#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 387#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 432#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 441#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 442#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 417#L74-3 assume 1 == ~c_dr_pc~0; 418#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 415#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 422#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 461#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 446#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 447#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 458#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 396#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 398#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 452#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 421#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 404#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 405#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 430#L426 assume !(0 != start_simulation_~tmp~4); 376#L409-1 [2018-11-23 04:40:56,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash 434480677, now seen corresponding path program 1 times [2018-11-23 04:40:56,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,104 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-23 04:40:56,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:56,105 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash 188672275, now seen corresponding path program 1 times [2018-11-23 04:40:56,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,153 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-23 04:40:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,153 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:56,154 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-11-23 04:40:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,205 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2018-11-23 04:40:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:56,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 241 transitions. [2018-11-23 04:40:56,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-11-23 04:40:56,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 241 transitions. [2018-11-23 04:40:56,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-23 04:40:56,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-23 04:40:56,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 241 transitions. [2018-11-23 04:40:56,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,211 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2018-11-23 04:40:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 241 transitions. [2018-11-23 04:40:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-23 04:40:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 04:40:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 241 transitions. [2018-11-23 04:40:56,218 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2018-11-23 04:40:56,218 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2018-11-23 04:40:56,218 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:40:56,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 241 transitions. [2018-11-23 04:40:56,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-11-23 04:40:56,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,220 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] [2018-11-23 04:40:56,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,221 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 663#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 664#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 660#L212 assume !(1 == ~q_req_up~0); 662#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 758#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 756#L232-1 assume !(0 == ~q_read_ev~0); 754#L265-1 assume !(0 == ~q_write_ev~0); 753#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 752#L55 assume 1 == ~p_dw_pc~0; 751#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 749#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 748#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 747#L305 assume !(0 != activate_threads_~tmp~1); 730#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 731#L74 assume !(1 == ~c_dr_pc~0); 684#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 685#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 720#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 732#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 733#L313-2 assume !(1 == ~q_read_ev~0); 702#L283-1 assume !(1 == ~q_write_ev~0); 703#L409-1 [2018-11-23 04:40:56,221 INFO L796 eck$LassoCheckResult]: Loop: 703#L409-1 assume !false; 781#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 775#L354 assume !false; 774#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 772#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 723#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 724#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 704#L334 assume !(0 != eval_~tmp___1~0); 706#L370 start_simulation_~kernel_st~0 := 2; 744#L212-2 assume !(1 == ~q_req_up~0); 642#L212-3 start_simulation_~kernel_st~0 := 3; 643#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 707#L265-4 assume !(0 == ~q_write_ev~0); 708#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 769#L55-3 assume !(1 == ~p_dw_pc~0); 768#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 766#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 765#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 764#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 763#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 760#L74-3 assume !(1 == ~c_dr_pc~0); 759#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 757#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 755#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 734#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 715#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 716#L283-3 assume !(1 == ~q_write_ev~0); 729#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 804#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 802#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 801#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 800#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 796#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 793#L426 assume !(0 != start_simulation_~tmp~4); 703#L409-1 [2018-11-23 04:40:56,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -845383001, now seen corresponding path program 1 times [2018-11-23 04:40:56,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,239 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-23 04:40:56,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:56,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 1 times [2018-11-23 04:40:56,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,286 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-23 04:40:56,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,287 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:56,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:56,287 INFO L87 Difference]: Start difference. First operand 167 states and 241 transitions. cyclomatic complexity: 75 Second operand 3 states. [2018-11-23 04:40:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,325 INFO L93 Difference]: Finished difference Result 281 states and 398 transitions. [2018-11-23 04:40:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:56,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 398 transitions. [2018-11-23 04:40:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2018-11-23 04:40:56,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 398 transitions. [2018-11-23 04:40:56,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2018-11-23 04:40:56,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2018-11-23 04:40:56,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 398 transitions. [2018-11-23 04:40:56,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,331 INFO L705 BuchiCegarLoop]: Abstraction has 281 states and 398 transitions. [2018-11-23 04:40:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 398 transitions. [2018-11-23 04:40:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2018-11-23 04:40:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-23 04:40:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2018-11-23 04:40:56,338 INFO L728 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2018-11-23 04:40:56,338 INFO L608 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2018-11-23 04:40:56,339 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:40:56,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 390 transitions. [2018-11-23 04:40:56,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2018-11-23 04:40:56,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,341 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] [2018-11-23 04:40:56,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,341 INFO L794 eck$LassoCheckResult]: Stem: 1149#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1118#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1119#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 1115#L212 assume !(1 == ~q_req_up~0); 1117#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1156#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1157#L232-1 assume !(0 == ~q_read_ev~0); 1171#L265-1 assume !(0 == ~q_write_ev~0); 1128#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1129#L55 assume !(1 == ~p_dw_pc~0); 1144#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1145#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1191#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1192#L305 assume !(0 != activate_threads_~tmp~1); 1208#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1207#L74 assume !(1 == ~c_dr_pc~0); 1140#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1141#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1178#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1193#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1194#L313-2 assume !(1 == ~q_read_ev~0); 1161#L283-1 assume !(1 == ~q_write_ev~0); 1162#L409-1 [2018-11-23 04:40:56,342 INFO L796 eck$LassoCheckResult]: Loop: 1162#L409-1 assume !false; 1331#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1326#L354 assume !false; 1325#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1146#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1147#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1181#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1165#L334 assume !(0 != eval_~tmp___1~0); 1153#L370 start_simulation_~kernel_st~0 := 2; 1105#L212-2 assume !(1 == ~q_req_up~0); 1099#L212-3 start_simulation_~kernel_st~0 := 3; 1100#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1167#L265-4 assume !(0 == ~q_write_ev~0); 1168#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1369#L55-3 assume !(1 == ~p_dw_pc~0); 1351#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1185#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1163#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1164#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1138#L74-3 assume !(1 == ~c_dr_pc~0); 1135#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1136#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1143#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1196#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1173#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1174#L283-3 assume !(1 == ~q_write_ev~0); 1190#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1367#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1365#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1364#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1363#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1362#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1361#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1356#L426 assume !(0 != start_simulation_~tmp~4); 1162#L409-1 [2018-11-23 04:40:56,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2124707736, now seen corresponding path program 1 times [2018-11-23 04:40:56,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,429 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-23 04:40:56,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,429 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 2 times [2018-11-23 04:40:56,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,460 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-23 04:40:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,460 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:56,461 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. cyclomatic complexity: 117 Second operand 5 states. [2018-11-23 04:40:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,524 INFO L93 Difference]: Finished difference Result 662 states and 942 transitions. [2018-11-23 04:40:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:40:56,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 942 transitions. [2018-11-23 04:40:56,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 590 [2018-11-23 04:40:56,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 942 transitions. [2018-11-23 04:40:56,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2018-11-23 04:40:56,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2018-11-23 04:40:56,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 942 transitions. [2018-11-23 04:40:56,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,533 INFO L705 BuchiCegarLoop]: Abstraction has 662 states and 942 transitions. [2018-11-23 04:40:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 942 transitions. [2018-11-23 04:40:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 284. [2018-11-23 04:40:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 04:40:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2018-11-23 04:40:56,549 INFO L728 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2018-11-23 04:40:56,549 INFO L608 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2018-11-23 04:40:56,549 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:40:56,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 396 transitions. [2018-11-23 04:40:56,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2018-11-23 04:40:56,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,552 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] [2018-11-23 04:40:56,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,552 INFO L794 eck$LassoCheckResult]: Stem: 2107#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2072#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2063#L212 assume !(1 == ~q_req_up~0); 2065#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2114#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2115#L232-1 assume !(0 == ~q_read_ev~0); 2128#L265-1 assume !(0 == ~q_write_ev~0); 2131#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2176#L55 assume !(1 == ~p_dw_pc~0); 2175#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2174#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2173#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2172#L305 assume !(0 != activate_threads_~tmp~1); 2171#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2170#L74 assume !(1 == ~c_dr_pc~0); 2097#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2098#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2163#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2164#L313 assume !(0 != activate_threads_~tmp___0~1); 2270#L313-2 assume !(1 == ~q_read_ev~0); 2118#L283-1 assume !(1 == ~q_write_ev~0); 2119#L409-1 [2018-11-23 04:40:56,552 INFO L796 eck$LassoCheckResult]: Loop: 2119#L409-1 assume !false; 2266#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2049#L354 assume !false; 2050#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2104#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2105#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2141#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2120#L334 assume !(0 != eval_~tmp___1~0); 2111#L370 start_simulation_~kernel_st~0 := 2; 2055#L212-2 assume !(1 == ~q_req_up~0); 2051#L212-3 start_simulation_~kernel_st~0 := 3; 2052#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2122#L265-4 assume !(0 == ~q_write_ev~0); 2076#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2077#L55-3 assume !(1 == ~p_dw_pc~0); 2057#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2058#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2294#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2293#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2129#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2130#L74-3 assume !(1 == ~c_dr_pc~0); 2291#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2290#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2289#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2288#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2287#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2286#L283-3 assume !(1 == ~q_write_ev~0); 2283#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2282#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2279#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2278#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2274#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2272#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2271#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2269#L426 assume !(0 != start_simulation_~tmp~4); 2119#L409-1 [2018-11-23 04:40:56,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 1 times [2018-11-23 04:40:56,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1306066790, now seen corresponding path program 1 times [2018-11-23 04:40:56,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:56,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,642 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:56,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:56,643 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. cyclomatic complexity: 114 Second operand 5 states. [2018-11-23 04:40:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,744 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2018-11-23 04:40:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:40:56,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 586 transitions. [2018-11-23 04:40:56,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 368 [2018-11-23 04:40:56,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 430 states and 586 transitions. [2018-11-23 04:40:56,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2018-11-23 04:40:56,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-23 04:40:56,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 586 transitions. [2018-11-23 04:40:56,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,749 INFO L705 BuchiCegarLoop]: Abstraction has 430 states and 586 transitions. [2018-11-23 04:40:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 586 transitions. [2018-11-23 04:40:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 296. [2018-11-23 04:40:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-23 04:40:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 408 transitions. [2018-11-23 04:40:56,756 INFO L728 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2018-11-23 04:40:56,756 INFO L608 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2018-11-23 04:40:56,756 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 04:40:56,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 408 transitions. [2018-11-23 04:40:56,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 240 [2018-11-23 04:40:56,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,760 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] [2018-11-23 04:40:56,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,761 INFO L794 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2802#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2803#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2794#L212 assume !(1 == ~q_req_up~0); 2796#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2843#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2844#L232-1 assume !(0 == ~q_read_ev~0); 2858#L265-1 assume !(0 == ~q_write_ev~0); 2814#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2815#L55 assume !(1 == ~p_dw_pc~0); 2906#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2845#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2846#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2903#L305 assume !(0 != activate_threads_~tmp~1); 2883#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2863#L74 assume !(1 == ~c_dr_pc~0); 2864#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2866#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2867#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2884#L313 assume !(0 != activate_threads_~tmp___0~1); 2885#L313-2 assume !(1 == ~q_read_ev~0); 2849#L283-1 assume !(1 == ~q_write_ev~0); 2777#L409-1 [2018-11-23 04:40:56,761 INFO L796 eck$LassoCheckResult]: Loop: 2777#L409-1 assume !false; 2778#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2805#L354 assume !false; 2962#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2961#L245 assume !(0 == ~p_dw_st~0); 2957#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 2954#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2950#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2913#L334 assume !(0 != eval_~tmp___1~0); 2915#L370 start_simulation_~kernel_st~0 := 2; 2946#L212-2 assume !(1 == ~q_req_up~0); 2781#L212-3 start_simulation_~kernel_st~0 := 3; 2782#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2852#L265-4 assume !(0 == ~q_write_ev~0); 2807#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2808#L55-3 assume !(1 == ~p_dw_pc~0); 2788#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2789#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2879#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2853#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2854#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2824#L74-3 assume !(1 == ~c_dr_pc~0); 2821#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2822#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2829#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2888#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2889#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2880#L283-3 assume !(1 == ~q_write_ev~0); 2881#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2890#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3071#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3069#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3068#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3064#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3062#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2891#L426 assume !(0 != start_simulation_~tmp~4); 2777#L409-1 [2018-11-23 04:40:56,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 2 times [2018-11-23 04:40:56,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -100688383, now seen corresponding path program 1 times [2018-11-23 04:40:56,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,851 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-23 04:40:56,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:40:56,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:56,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:56,852 INFO L87 Difference]: Start difference. First operand 296 states and 408 transitions. cyclomatic complexity: 114 Second operand 5 states. [2018-11-23 04:40:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,912 INFO L93 Difference]: Finished difference Result 532 states and 732 transitions. [2018-11-23 04:40:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:40:56,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 732 transitions. [2018-11-23 04:40:56,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 476 [2018-11-23 04:40:56,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 732 transitions. [2018-11-23 04:40:56,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2018-11-23 04:40:56,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2018-11-23 04:40:56,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 732 transitions. [2018-11-23 04:40:56,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:56,924 INFO L705 BuchiCegarLoop]: Abstraction has 532 states and 732 transitions. [2018-11-23 04:40:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 732 transitions. [2018-11-23 04:40:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 302. [2018-11-23 04:40:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-23 04:40:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 410 transitions. [2018-11-23 04:40:56,930 INFO L728 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2018-11-23 04:40:56,930 INFO L608 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2018-11-23 04:40:56,930 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 04:40:56,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 410 transitions. [2018-11-23 04:40:56,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-23 04:40:56,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,933 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] [2018-11-23 04:40:56,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,933 INFO L794 eck$LassoCheckResult]: Stem: 3675#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3642#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3643#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 3634#L212 assume !(1 == ~q_req_up~0); 3636#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3683#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3684#L232-1 assume !(0 == ~q_read_ev~0); 3700#L265-1 assume !(0 == ~q_write_ev~0); 3652#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3653#L55 assume !(1 == ~p_dw_pc~0); 3738#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3685#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3686#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3735#L305 assume !(0 != activate_threads_~tmp~1); 3719#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3703#L74 assume !(1 == ~c_dr_pc~0); 3704#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3706#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3707#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3720#L313 assume !(0 != activate_threads_~tmp___0~1); 3721#L313-2 assume !(1 == ~q_read_ev~0); 3689#L283-1 assume !(1 == ~q_write_ev~0); 3690#L409-1 [2018-11-23 04:40:56,933 INFO L796 eck$LassoCheckResult]: Loop: 3690#L409-1 assume !false; 3791#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3779#L354 assume !false; 3777#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3775#L245 assume !(0 == ~p_dw_st~0); 3772#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3769#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3767#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3764#L334 assume !(0 != eval_~tmp___1~0); 3761#L370 start_simulation_~kernel_st~0 := 2; 3756#L212-2 assume !(1 == ~q_req_up~0); 3751#L212-3 start_simulation_~kernel_st~0 := 3; 3749#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3747#L265-4 assume !(0 == ~q_write_ev~0); 3744#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3637#L55-3 assume !(1 == ~p_dw_pc~0); 3638#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 3837#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3835#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3833#L305-3 assume !(0 != activate_threads_~tmp~1); 3831#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3819#L74-3 assume !(1 == ~c_dr_pc~0); 3817#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3816#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3815#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3814#L313-3 assume !(0 != activate_threads_~tmp___0~1); 3812#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3808#L283-3 assume !(1 == ~q_write_ev~0); 3804#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3803#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3801#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3800#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3799#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3797#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3794#L426 assume !(0 != start_simulation_~tmp~4); 3690#L409-1 [2018-11-23 04:40:56,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 3 times [2018-11-23 04:40:56,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1689036285, now seen corresponding path program 1 times [2018-11-23 04:40:56,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,974 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-23 04:40:56,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:56,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:56,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:56,976 INFO L87 Difference]: Start difference. First operand 302 states and 410 transitions. cyclomatic complexity: 110 Second operand 3 states. [2018-11-23 04:40:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,998 INFO L93 Difference]: Finished difference Result 375 states and 490 transitions. [2018-11-23 04:40:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:56,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 490 transitions. [2018-11-23 04:40:57,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2018-11-23 04:40:57,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 490 transitions. [2018-11-23 04:40:57,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-11-23 04:40:57,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-11-23 04:40:57,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 490 transitions. [2018-11-23 04:40:57,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:57,005 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2018-11-23 04:40:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 490 transitions. [2018-11-23 04:40:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-11-23 04:40:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-23 04:40:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 490 transitions. [2018-11-23 04:40:57,012 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2018-11-23 04:40:57,012 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2018-11-23 04:40:57,013 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 04:40:57,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 490 transitions. [2018-11-23 04:40:57,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2018-11-23 04:40:57,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:57,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:57,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,016 INFO L794 eck$LassoCheckResult]: Stem: 4355#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4324#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4325#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 4321#L212 assume !(1 == ~q_req_up~0); 4323#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4363#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4364#L232-1 assume !(0 == ~q_read_ev~0); 4383#L265-1 assume !(0 == ~q_write_ev~0); 4335#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4336#L55 assume !(1 == ~p_dw_pc~0); 4426#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4365#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4366#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4423#L305 assume !(0 != activate_threads_~tmp~1); 4406#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4388#L74 assume !(1 == ~c_dr_pc~0); 4347#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 4348#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4390#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4407#L313 assume !(0 != activate_threads_~tmp___0~1); 4408#L313-2 assume !(1 == ~q_read_ev~0); 4372#L283-1 assume !(1 == ~q_write_ev~0); 4373#L409-1 assume !false; 4504#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4494#L354 assume !false; 4493#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4489#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2018-11-23 04:40:57,016 INFO L796 eck$LassoCheckResult]: Loop: 4487#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 4486#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4485#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4483#L334 assume 0 != eval_~tmp___1~0; 4484#L334-1 assume !(0 == ~p_dw_st~0); 4433#L339 assume !(0 == ~c_dr_st~0); 4496#L354 assume !false; 4384#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4385#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2018-11-23 04:40:57,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 1 times [2018-11-23 04:40:57,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:57,056 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-23 04:40:57,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:57,057 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:57,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 145107811, now seen corresponding path program 1 times [2018-11-23 04:40:57,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:57,120 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-23 04:40:57,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:40:57,120 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:57,121 INFO L87 Difference]: Start difference. First operand 375 states and 490 transitions. cyclomatic complexity: 117 Second operand 5 states. [2018-11-23 04:40:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:57,167 INFO L93 Difference]: Finished difference Result 415 states and 530 transitions. [2018-11-23 04:40:57,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:40:57,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 530 transitions. [2018-11-23 04:40:57,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 341 [2018-11-23 04:40:57,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 415 states and 530 transitions. [2018-11-23 04:40:57,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2018-11-23 04:40:57,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2018-11-23 04:40:57,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 530 transitions. [2018-11-23 04:40:57,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:57,171 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 530 transitions. [2018-11-23 04:40:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 530 transitions. [2018-11-23 04:40:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2018-11-23 04:40:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-23 04:40:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 486 transitions. [2018-11-23 04:40:57,178 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2018-11-23 04:40:57,178 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2018-11-23 04:40:57,179 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 04:40:57,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 486 transitions. [2018-11-23 04:40:57,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2018-11-23 04:40:57,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:57,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:57,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,181 INFO L794 eck$LassoCheckResult]: Stem: 5161#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5129#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5130#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5122#L212 assume !(1 == ~q_req_up~0); 5124#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5167#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5168#L232-1 assume !(0 == ~q_read_ev~0); 5187#L265-1 assume !(0 == ~q_write_ev~0); 5140#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5141#L55 assume !(1 == ~p_dw_pc~0); 5237#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 5169#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5170#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5234#L305 assume !(0 != activate_threads_~tmp~1); 5215#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5192#L74 assume !(1 == ~c_dr_pc~0); 5193#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 5195#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5196#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5216#L313 assume !(0 != activate_threads_~tmp___0~1); 5217#L313-2 assume !(1 == ~q_read_ev~0); 5178#L283-1 assume !(1 == ~q_write_ev~0); 5179#L409-1 assume !false; 5173#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 5174#L354 assume !false; 5188#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5189#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2018-11-23 04:40:57,182 INFO L796 eck$LassoCheckResult]: Loop: 5160#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5175#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5317#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 5316#L334 assume 0 != eval_~tmp___1~0; 5315#L334-1 assume !(0 == ~p_dw_st~0); 5312#L339 assume !(0 == ~c_dr_st~0); 5302#L354 assume !false; 5300#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5159#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2018-11-23 04:40:57,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 2 times [2018-11-23 04:40:57,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:57,209 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-23 04:40:57,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:57,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:57,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -534950559, now seen corresponding path program 1 times [2018-11-23 04:40:57,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:57,222 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-23 04:40:57,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:57,222 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:57,223 INFO L87 Difference]: Start difference. First operand 375 states and 486 transitions. cyclomatic complexity: 113 Second operand 3 states. [2018-11-23 04:40:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:57,240 INFO L93 Difference]: Finished difference Result 489 states and 622 transitions. [2018-11-23 04:40:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:57,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 622 transitions. [2018-11-23 04:40:57,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2018-11-23 04:40:57,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 489 states and 622 transitions. [2018-11-23 04:40:57,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 489 [2018-11-23 04:40:57,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 489 [2018-11-23 04:40:57,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 622 transitions. [2018-11-23 04:40:57,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:57,245 INFO L705 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2018-11-23 04:40:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 622 transitions. [2018-11-23 04:40:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2018-11-23 04:40:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-11-23 04:40:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 622 transitions. [2018-11-23 04:40:57,251 INFO L728 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2018-11-23 04:40:57,251 INFO L608 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2018-11-23 04:40:57,251 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 04:40:57,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 622 transitions. [2018-11-23 04:40:57,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2018-11-23 04:40:57,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:57,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:57,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,253 INFO L794 eck$LassoCheckResult]: Stem: 6032#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5999#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6000#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5993#L212 assume !(1 == ~q_req_up~0); 5995#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6038#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6039#L232-1 assume !(0 == ~q_read_ev~0); 6056#L265-1 assume !(0 == ~q_write_ev~0); 6010#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6011#L55 assume !(1 == ~p_dw_pc~0); 6099#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6040#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6041#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6096#L305 assume !(0 != activate_threads_~tmp~1); 6078#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6059#L74 assume !(1 == ~c_dr_pc~0); 6060#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6410#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6409#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6408#L313 assume !(0 != activate_threads_~tmp___0~1); 6081#L313-2 assume !(1 == ~q_read_ev~0); 6045#L283-1 assume !(1 == ~q_write_ev~0); 6046#L409-1 assume !false; 6403#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 6401#L354 assume !false; 6399#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6314#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2018-11-23 04:40:57,253 INFO L796 eck$LassoCheckResult]: Loop: 6316#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6155#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6311#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 6292#L334 assume 0 != eval_~tmp___1~0; 6207#L334-1 assume !(0 == ~p_dw_st~0); 6203#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 6196#L358 assume !(0 != eval_~tmp___0~2); 6197#L354 assume !false; 6321#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6317#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2018-11-23 04:40:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 3 times [2018-11-23 04:40:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:57,268 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-23 04:40:57,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:57,268 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:57,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 545725425, now seen corresponding path program 1 times [2018-11-23 04:40:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:57,328 INFO L87 Difference]: Start difference. First operand 489 states and 622 transitions. cyclomatic complexity: 135 Second operand 3 states. [2018-11-23 04:40:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:57,404 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2018-11-23 04:40:57,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:57,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 427 transitions. [2018-11-23 04:40:57,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2018-11-23 04:40:57,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 427 transitions. [2018-11-23 04:40:57,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 344 [2018-11-23 04:40:57,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 344 [2018-11-23 04:40:57,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 427 transitions. [2018-11-23 04:40:57,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:57,409 INFO L705 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2018-11-23 04:40:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 427 transitions. [2018-11-23 04:40:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-11-23 04:40:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-11-23 04:40:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2018-11-23 04:40:57,414 INFO L728 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2018-11-23 04:40:57,414 INFO L608 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2018-11-23 04:40:57,414 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 04:40:57,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 427 transitions. [2018-11-23 04:40:57,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2018-11-23 04:40:57,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:57,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:57,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:57,416 INFO L794 eck$LassoCheckResult]: Stem: 6875#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6841#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6842#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 6835#L212 assume !(1 == ~q_req_up~0); 6837#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6883#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6884#L232-1 assume !(0 == ~q_read_ev~0); 6901#L265-1 assume !(0 == ~q_write_ev~0); 6904#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6882#L55 assume !(1 == ~p_dw_pc~0); 6873#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6874#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6885#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6952#L305 assume !(0 != activate_threads_~tmp~1); 6923#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6907#L74 assume !(1 == ~c_dr_pc~0); 6866#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6867#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6909#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6924#L313 assume !(0 != activate_threads_~tmp___0~1); 6925#L313-2 assume !(1 == ~q_read_ev~0); 6892#L283-1 assume !(1 == ~q_write_ev~0); 6893#L409-1 assume !false; 7095#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 7093#L354 assume !false; 7091#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7088#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7086#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 7084#L334 assume 0 != eval_~tmp___1~0; 7083#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 7082#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 7008#L118 assume 0 == ~p_dw_pc~0; 7006#L129-1 [2018-11-23 04:40:57,417 INFO L796 eck$LassoCheckResult]: Loop: 7006#L129-1 assume !false; 6986#L130 assume !(0 == ~q_free~0); 6987#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 7006#L129-1 [2018-11-23 04:40:57,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 316097349, now seen corresponding path program 1 times [2018-11-23 04:40:57,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 206771, now seen corresponding path program 1 times [2018-11-23 04:40:57,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2006979089, now seen corresponding path program 1 times [2018-11-23 04:40:57,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,515 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:57,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:57,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:57,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:57,516 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:57,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:57,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:57,517 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:57,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-23 04:40:57,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:57,517 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,623 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:57,623 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:57,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:57,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:57,638 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_req_up~0=1} Honda state: {~q_req_up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:57,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:57,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:57,680 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Honda state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:57,709 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:57,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:57,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:57,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:57,804 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:57,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:57,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:57,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:40:57,879 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:57,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:57,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:57,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:57,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:57,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:57,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:57,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:57,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-23 04:40:57,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:57,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:57,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:57,955 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:57,958 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:57,960 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-23 04:40:57,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:57,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:57,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,967 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-23 04:40:57,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:57,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:57,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,970 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-23 04:40:57,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,971 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:57,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:57,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:57,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,975 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-23 04:40:57,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:57,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:57,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,978 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 04:40:57,978 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-23 04:40:57,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:57,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:57,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,982 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-23 04:40:57,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:57,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:57,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,986 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-23 04:40:57,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,986 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:57,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:57,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:57,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,991 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-23 04:40:57,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,992 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:57,993 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:57,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,994 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 04:40:57,994 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-23 04:40:57,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:57,996 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:57,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:57,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:57,998 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-23 04:40:57,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:57,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:57,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:57,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:57,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,000 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,002 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-23 04:40:58,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,004 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:58,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,008 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-23 04:40:58,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,011 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 04:40:58,011 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-23 04:40:58,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,012 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,016 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-23 04:40:58,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,017 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,020 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-23 04:40:58,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,022 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:58,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,027 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-23 04:40:58,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:58,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,029 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,031 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 04:40:58,031 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-23 04:40:58,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,032 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:58,033 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:58,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,038 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-23 04:40:58,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,038 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:58,039 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:58,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,044 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-23 04:40:58,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,045 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:58,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:58,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,053 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-23 04:40:58,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,054 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,055 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:58,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:58,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,057 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 04:40:58,057 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-23 04:40:58,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,058 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:58,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,058 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,059 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,064 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-23 04:40:58,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,065 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:58,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,065 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,081 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-23 04:40:58,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,082 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:58,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,087 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:58,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,104 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-23 04:40:58,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,107 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:58,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,109 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,114 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 04:40:58,114 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-23 04:40:58,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,115 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,117 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,124 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-23 04:40:58,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,125 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,127 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,144 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-23 04:40:58,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,145 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,148 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:58,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,157 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-23 04:40:58,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,158 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:58,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:58,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,161 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 04:40:58,161 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-23 04:40:58,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,162 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,165 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-23 04:40:58,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,167 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,170 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-23 04:40:58,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,171 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,171 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,172 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:58,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,177 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-23 04:40:58,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:58,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:58,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:58,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,181 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 04:40:58,181 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-23 04:40:58,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,182 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,182 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:58,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:58,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,189 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-23 04:40:58,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,190 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:58,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:58,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,196 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-23 04:40:58,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,197 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,197 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:58,197 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:58,199 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:58,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,209 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-23 04:40:58,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:58,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:58,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:58,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:58,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:58,210 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:58,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:58,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:58,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:58,449 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-23 04:40:58,491 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:58,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:58,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:58,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:58,492 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:58,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:58,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:58,492 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:58,492 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-23 04:40:58,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:58,492 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:58,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-23 04:40:58,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,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-23 04:40:58,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-23 04:40:58,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:58,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:58,753 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,771 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Honda state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,824 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,851 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,871 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,888 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,895 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,932 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp~1=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,961 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a_t~0=0} Honda state: {~a_t~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,977 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:58,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:58,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:58,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:58,997 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:59,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,015 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Honda state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:59,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:59,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,051 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_pc~0=0} Honda state: {~c_dr_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/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-23 04:40:59,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,069 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_i~0=0} Honda state: {~c_dr_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,086 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,087 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6=0} Honda state: {ULTIMATE.start_eval_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_st~0=0} Honda state: {~p_dw_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,133 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,136 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0, ULTIMATE.start_exists_runnable_thread_~__retres1~2=0, ULTIMATE.start_exists_runnable_thread_#res=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=1, ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,151 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:59,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,204 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_pc~0=0} Honda state: {~p_dw_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,220 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_last_read~0=0} Honda state: {~c_last_read~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,255 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_i~0=0} Honda state: {~p_dw_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~4=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:59,339 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=0} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:59,365 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:59,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:59,404 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:40:59,405 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:59,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:59,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:59,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:59,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:59,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:59,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:59,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:59,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-23 04:40:59,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:59,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:59,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-23 04:40:59,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-23 04:40:59,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,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-23 04:40:59,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,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-23 04:40:59,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,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-23 04:40:59,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,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-23 04:40:59,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-23 04:40:59,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,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-23 04:40:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:59,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:59,738 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:59,738 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-23 04:40:59,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:59,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,743 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-23 04:40:59,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,744 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-23 04:40:59,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,746 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-23 04:40:59,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,750 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-23 04:40:59,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,752 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-23 04:40:59,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,753 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-23 04:40:59,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,755 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-23 04:40:59,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,757 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-23 04:40:59,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,760 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-23 04:40:59,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,762 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-23 04:40:59,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,765 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-23 04:40:59,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,766 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-23 04:40:59,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,768 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-23 04:40:59,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,770 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-23 04:40:59,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,773 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-23 04:40:59,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,775 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-23 04:40:59,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,779 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-23 04:40:59,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,782 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-23 04:40:59,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,784 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-23 04:40:59,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:59,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:59,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,787 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-23 04:40:59,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,789 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-23 04:40:59,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,790 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-23 04:40:59,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:59,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:59,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:59,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:59,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:59,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:59,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:59,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:59,793 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:59,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:59,794 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 04:40:59,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 04:40:59,805 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:40:59,812 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 04:40:59,812 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 04:40:59,814 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:40:59,816 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 04:40:59,816 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:40:59,817 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-11-23 04:40:59,851 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 04:40:59,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:59,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:59,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:59,984 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-23 04:40:59,989 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 04:40:59,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84 Second operand 5 states. [2018-11-23 04:41:00,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 2260 states and 2825 transitions. Complement of second has 10 states. [2018-11-23 04:41:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 04:41:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:41:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 494 transitions. [2018-11-23 04:41:00,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 3 letters. [2018-11-23 04:41:00,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:41:00,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 36 letters. Loop has 3 letters. [2018-11-23 04:41:00,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:41:00,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 6 letters. [2018-11-23 04:41:00,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:41:00,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2260 states and 2825 transitions. [2018-11-23 04:41:00,168 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1134 [2018-11-23 04:41:00,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2260 states to 1818 states and 2267 transitions. [2018-11-23 04:41:00,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1267 [2018-11-23 04:41:00,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2018-11-23 04:41:00,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1818 states and 2267 transitions. [2018-11-23 04:41:00,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:41:00,177 INFO L705 BuchiCegarLoop]: Abstraction has 1818 states and 2267 transitions. [2018-11-23 04:41:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states and 2267 transitions. [2018-11-23 04:41:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1730. [2018-11-23 04:41:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2018-11-23 04:41:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2161 transitions. [2018-11-23 04:41:00,200 INFO L728 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2018-11-23 04:41:00,200 INFO L608 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2018-11-23 04:41:00,200 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 04:41:00,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1730 states and 2161 transitions. [2018-11-23 04:41:00,206 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1068 [2018-11-23 04:41:00,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:41:00,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:41:00,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,207 INFO L794 eck$LassoCheckResult]: Stem: 9672#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 9614#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 9615#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 9612#L212 assume !(1 == ~q_req_up~0); 9597#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 9598#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9686#L232-1 assume !(0 == ~q_read_ev~0); 9728#L265-1 assume !(0 == ~q_write_ev~0); 9639#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9640#L55 assume !(1 == ~p_dw_pc~0); 9670#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 9671#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9687#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9760#L305 assume !(0 != activate_threads_~tmp~1); 9761#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9736#L74 assume !(1 == ~c_dr_pc~0); 9656#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 9657#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9738#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9765#L313 assume !(0 != activate_threads_~tmp___0~1); 9766#L313-2 assume !(1 == ~q_read_ev~0); 9703#L283-1 assume !(1 == ~q_write_ev~0); 9704#L409-1 assume !false; 10449#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10447#L354 assume !false; 10445#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10443#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10441#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10439#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10437#L334 assume 0 != eval_~tmp___1~0; 10435#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10433#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10431#L118 assume !(0 == ~p_dw_pc~0); 10429#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2018-11-23 04:41:00,208 INFO L796 eck$LassoCheckResult]: Loop: 10424#L129-1 assume !false; 10425#L130 assume !(0 == ~q_free~0); 10396#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 10398#L129-1 assume !false; 10395#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10393#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 10112#L358 assume 0 != eval_~tmp___0~2;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 10381#L159 assume 0 == ~c_dr_pc~0; 10348#L11-2 assume !false; 10100#L171 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 10098#L354 assume !false; 10096#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10094#L245 assume !(0 == ~p_dw_st~0); 10091#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10088#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10084#L334 assume !(0 != eval_~tmp___1~0); 10083#L370 start_simulation_~kernel_st~0 := 2; 10078#L212-2 assume !(1 == ~q_req_up~0); 10076#L212-3 start_simulation_~kernel_st~0 := 3; 10075#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10074#L265-4 assume !(0 == ~q_write_ev~0); 10073#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10072#L55-3 assume 1 == ~p_dw_pc~0; 10070#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10069#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10068#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10066#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10065#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10063#L74-3 assume !(1 == ~c_dr_pc~0); 10062#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 10061#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10060#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10059#L313-3 assume !(0 != activate_threads_~tmp___0~1); 10058#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10057#L283-3 assume !(1 == ~q_write_ev~0); 10014#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10056#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10055#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10054#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10053#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10052#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10051#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10050#L426 assume !(0 != start_simulation_~tmp~4); 10049#L409-1 assume !false; 10048#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10047#L354 assume !false; 10046#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10045#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10044#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10043#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10042#L334 assume 0 != eval_~tmp___1~0; 10041#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10040#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10038#L118 assume !(0 == ~p_dw_pc~0); 10039#L121 assume 1 == ~p_dw_pc~0; 10116#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 10119#L129-1 assume !false; 10115#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10111#L339 assume !(0 == ~c_dr_st~0); 10109#L354 assume !false; 10107#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10105#L245 assume !(0 == ~p_dw_st~0); 10103#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10099#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10097#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10095#L334 assume !(0 != eval_~tmp___1~0); 10093#L370 start_simulation_~kernel_st~0 := 2; 10089#L212-2 assume 1 == ~q_req_up~0; 10086#L25-3 assume 0 == ~q_free~0;~q_write_ev~0 := 0; 10087#L25-5 assume 1 == ~q_free~0;~q_read_ev~0 := 0; 10277#L30-3 ~q_ev~0 := 0;~q_req_up~0 := 0; 10357#L212-3 start_simulation_~kernel_st~0 := 3; 10356#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10355#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 10354#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10353#L55-3 assume 1 == ~p_dw_pc~0; 10352#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10335#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10336#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10345#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10344#L74-3 assume 1 == ~c_dr_pc~0; 10342#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 10343#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10033#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10034#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 10459#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10457#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 10456#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10455#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10454#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10453#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10452#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10451#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10450#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10448#L426 assume !(0 != start_simulation_~tmp~4); 10446#L409-1 assume !false; 10444#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10442#L354 assume !false; 10440#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10438#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10436#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10434#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10432#L334 assume 0 != eval_~tmp___1~0; 10430#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10428#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10426#L118 assume !(0 == ~p_dw_pc~0); 10423#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2018-11-23 04:41:00,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1209083458, now seen corresponding path program 1 times [2018-11-23 04:41:00,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:41:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:41:00,230 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-23 04:41:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:41:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:41:00,230 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:41:00,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash 672189047, now seen corresponding path program 1 times [2018-11-23 04:41:00,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:41:00,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:41:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-23 04:41:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:41:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:41:00,258 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:41:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:41:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:41:00,258 INFO L87 Difference]: Start difference. First operand 1730 states and 2161 transitions. cyclomatic complexity: 439 Second operand 3 states. [2018-11-23 04:41:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:41:00,288 INFO L93 Difference]: Finished difference Result 1296 states and 1625 transitions. [2018-11-23 04:41:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:41:00,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1296 states and 1625 transitions. [2018-11-23 04:41:00,294 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 610 [2018-11-23 04:41:00,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1296 states to 1296 states and 1625 transitions. [2018-11-23 04:41:00,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2018-11-23 04:41:00,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2018-11-23 04:41:00,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1296 states and 1625 transitions. [2018-11-23 04:41:00,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:41:00,300 INFO L705 BuchiCegarLoop]: Abstraction has 1296 states and 1625 transitions. [2018-11-23 04:41:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states and 1625 transitions. [2018-11-23 04:41:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1252. [2018-11-23 04:41:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-23 04:41:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1565 transitions. [2018-11-23 04:41:00,318 INFO L728 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2018-11-23 04:41:00,318 INFO L608 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2018-11-23 04:41:00,318 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 04:41:00,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1252 states and 1565 transitions. [2018-11-23 04:41:00,322 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 594 [2018-11-23 04:41:00,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:41:00,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:41:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,323 INFO L794 eck$LassoCheckResult]: Stem: 12701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 12647#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 12648#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 12641#L212 assume !(1 == ~q_req_up~0); 12630#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 12631#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 12716#L232-1 assume !(0 == ~q_read_ev~0); 12754#L265-1 assume !(0 == ~q_write_ev~0); 12672#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12673#L55 assume !(1 == ~p_dw_pc~0); 12699#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 12700#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12717#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12781#L305 assume !(0 != activate_threads_~tmp~1); 12782#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12759#L74 assume !(1 == ~c_dr_pc~0); 12689#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 12690#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12761#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12786#L313 assume !(0 != activate_threads_~tmp___0~1); 12787#L313-2 assume !(1 == ~q_read_ev~0); 12730#L283-1 assume !(1 == ~q_write_ev~0); 12731#L409-1 assume !false; 13203#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13202#L354 assume !false; 13201#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13200#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13199#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13198#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13197#L334 assume 0 != eval_~tmp___1~0; 13196#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 13195#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 13194#L118 assume 0 == ~p_dw_pc~0; 13192#L129-1 assume !false; 13193#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 13313#L339 [2018-11-23 04:41:00,323 INFO L796 eck$LassoCheckResult]: Loop: 13313#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 13177#L358 assume !(0 != eval_~tmp___0~2); 13178#L354 assume !false; 13329#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13327#L245 assume !(0 == ~p_dw_st~0); 13324#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 13287#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13320#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13317#L334 assume 0 != eval_~tmp___1~0; 13315#L334-1 assume !(0 == ~p_dw_st~0); 13313#L339 [2018-11-23 04:41:00,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1173119927, now seen corresponding path program 1 times [2018-11-23 04:41:00,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:41:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:41:00,336 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-23 04:41:00,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:41:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:41:00,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:41:00,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 2 times [2018-11-23 04:41:00,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:41:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:41:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:41:00,404 INFO L87 Difference]: Start difference. First operand 1252 states and 1565 transitions. cyclomatic complexity: 320 Second operand 3 states. [2018-11-23 04:41:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:41:00,462 INFO L93 Difference]: Finished difference Result 1925 states and 2391 transitions. [2018-11-23 04:41:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:41:00,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2391 transitions. [2018-11-23 04:41:00,474 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 965 [2018-11-23 04:41:00,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1924 states and 2390 transitions. [2018-11-23 04:41:00,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1122 [2018-11-23 04:41:00,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1122 [2018-11-23 04:41:00,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1924 states and 2390 transitions. [2018-11-23 04:41:00,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:41:00,483 INFO L705 BuchiCegarLoop]: Abstraction has 1924 states and 2390 transitions. [2018-11-23 04:41:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states and 2390 transitions. [2018-11-23 04:41:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1660. [2018-11-23 04:41:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2018-11-23 04:41:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2066 transitions. [2018-11-23 04:41:00,508 INFO L728 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2018-11-23 04:41:00,508 INFO L608 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2018-11-23 04:41:00,508 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 04:41:00,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1660 states and 2066 transitions. [2018-11-23 04:41:00,515 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 798 [2018-11-23 04:41:00,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:41:00,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:41:00,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:41:00,516 INFO L794 eck$LassoCheckResult]: Stem: 15882#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 15828#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 15829#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 15817#L212 assume !(1 == ~q_req_up~0); 15811#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 15812#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 15895#L232-1 assume !(0 == ~q_read_ev~0); 15927#L265-1 assume !(0 == ~q_write_ev~0); 15846#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15847#L55 assume !(1 == ~p_dw_pc~0); 15876#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 15877#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15896#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15947#L305 assume !(0 != activate_threads_~tmp~1); 15948#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15934#L74 assume !(1 == ~c_dr_pc~0); 15868#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 15869#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15936#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 15956#L313 assume !(0 != activate_threads_~tmp___0~1); 15957#L313-2 assume !(1 == ~q_read_ev~0); 15909#L283-1 assume !(1 == ~q_write_ev~0); 15910#L409-1 assume !false; 16496#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 16495#L354 assume !false; 16494#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16493#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 16492#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16491#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16490#L334 assume 0 != eval_~tmp___1~0; 16488#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 16486#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 16482#L118 assume 0 == ~p_dw_pc~0; 16468#L129-1 assume !false; 16442#L130 assume !(0 == ~q_free~0); 16279#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 16370#L129-1 assume !false; 17091#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 17090#L339 [2018-11-23 04:41:00,516 INFO L796 eck$LassoCheckResult]: Loop: 17090#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 16584#L358 assume !(0 != eval_~tmp___0~2); 17089#L354 assume !false; 17105#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 17103#L245 assume !(0 == ~p_dw_st~0); 17101#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 16798#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 17098#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 17094#L334 assume 0 != eval_~tmp___1~0; 17092#L334-1 assume !(0 == ~p_dw_st~0); 17090#L339 [2018-11-23 04:41:00,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -266582925, now seen corresponding path program 1 times [2018-11-23 04:41:00,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:41:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 3 times [2018-11-23 04:41:00,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:41:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:41:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1848061315, now seen corresponding path program 1 times [2018-11-23 04:41:00,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:41:00,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:41:00,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:41:00,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:41:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:00,858 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; [?] havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~q_req_up~0); [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !(0 == ~q_read_ev~0); [?] assume !(0 == ~q_write_ev~0); [?] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [?] activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; [?] assume !(0 != activate_threads_~tmp___0~1); [?] assume !(1 == ~q_read_ev~0); [?] assume !(1 == ~q_write_ev~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; [?] assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; [?] assume !(0 != eval_~tmp___0~2); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) ----- [2018-11-23 04:41:00,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:41:00 BoogieIcfgContainer [2018-11-23 04:41:00,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:41:00,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:41:00,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:41:00,949 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:41:00,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:55" (3/4) ... [2018-11-23 04:41:00,954 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; [?] havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~q_req_up~0); [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !(0 == ~q_read_ev~0); [?] assume !(0 == ~q_write_ev~0); [?] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [?] activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; [?] assume !(0 != activate_threads_~tmp___0~1); [?] assume !(1 == ~q_read_ev~0); [?] assume !(1 == ~q_write_ev~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; [?] assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; [?] assume !(0 != eval_~tmp___0~2); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) ----- [2018-11-23 04:41:01,219 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e5e91762-d255-4820-9f16-93afc380fbf5/bin-2019/uautomizer/witness.graphml [2018-11-23 04:41:01,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:41:01,220 INFO L168 Benchmark]: Toolchain (without parser) took 6188.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 958.0 MB in the beginning and 989.7 MB in the end (delta: -31.6 MB). Peak memory consumption was 278.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,221 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:41:01,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 941.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.05 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,222 INFO L168 Benchmark]: Boogie Preprocessor took 58.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,222 INFO L168 Benchmark]: RCFGBuilder took 358.33 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,222 INFO L168 Benchmark]: BuchiAutomizer took 5259.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 90.5 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,223 INFO L168 Benchmark]: Witness Printer took 271.42 ms. Allocated memory is still 1.3 GB. Free memory was 995.9 MB in the beginning and 989.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:01,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 941.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.05 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.33 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5259.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 90.5 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. * Witness Printer took 271.42 ms. Allocated memory is still 1.3 GB. Free memory was 995.9 MB in the beginning and 989.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.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 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 7 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1660 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 3.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1730 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1841 SDtfs, 2087 SDslu, 2232 SDs, 0 SdLazy, 243 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN2 SILU0 SILI8 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq201 hnf90 smp100 dnf132 smp100 tf104 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 354]: 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_last_write=4, c_dr_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bd1849f=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5051fbd0=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15c7211a=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=1, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37296f43=0, q_free=0, __retres1=0, p_dw_st=2, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@751be8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52d731c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7be756f5=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 329]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; [?] havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~q_req_up~0); [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !(0 == ~q_read_ev~0); [?] assume !(0 == ~q_write_ev~0); [?] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [?] activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; [?] assume !(0 != activate_threads_~tmp___0~1); [?] assume !(1 == ~q_read_ev~0); [?] assume !(1 == ~q_write_ev~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; [?] assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; [?] assume !(0 != eval_~tmp___0~2); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; [?] havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; [?] assume !(1 == ~q_req_up~0); [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !(0 == ~q_read_ev~0); [?] assume !(0 == ~q_write_ev~0); [?] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [?] activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; [?] assume !(0 != activate_threads_~tmp___0~1); [?] assume !(1 == ~q_read_ev~0); [?] assume !(1 == ~q_write_ev~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; [?] assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212-L218] assume !(1 == ~q_req_up~0); [L227-L231] assume 1 == ~p_dw_i~0; [L228] ~p_dw_st~0 := 0; [L232-L236] assume 1 == ~c_dr_i~0; [L233] ~c_dr_st~0 := 0; [L265-L269] assume !(0 == ~q_read_ev~0); [L270-L274] assume !(0 == ~q_write_ev~0); [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55-L64] assume !(1 == ~p_dw_pc~0); [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] assume !(0 != activate_threads_~tmp~1); [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74-L83] assume !(1 == ~c_dr_pc~0); [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] assume !(0 != activate_threads_~tmp___0~1); [L283-L287] assume !(1 == ~q_read_ev~0); [L288-L292] assume !(1 == ~q_write_ev~0); [L409-L431] assume !false; [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume 0 == ~p_dw_st~0; [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume 0 == ~p_dw_st~0; [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] assume 0 != eval_~tmp~2; [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118-L126] assume 0 == ~p_dw_pc~0; [L129-L147] assume !false; [L131-L139] assume !(0 == ~q_free~0); [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] assume !false; [L131-L139] assume 0 == ~q_free~0; [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L456] havoc main_~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L461] havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4; [L396] havoc start_simulation_~kernel_st~0; [L397] havoc start_simulation_~tmp~4; [L401] start_simulation_~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L405] havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1; [L298] havoc activate_threads_~tmp~1; [L299] havoc activate_threads_~tmp___0~1; [L303] havoc is_do_write_p_triggered_#res; [L303] havoc is_do_write_p_triggered_~__retres1~0; [L52] havoc is_do_write_p_triggered_~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] is_do_write_p_triggered_~__retres1~0 := 0; [L67] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L303] activate_threads_#t~ret3 := is_do_write_p_triggered_#res; [L303] activate_threads_~tmp~1 := activate_threads_#t~ret3; [L303] havoc activate_threads_#t~ret3; [L305-L309] COND FALSE !(0 != activate_threads_~tmp~1) [L311] havoc is_do_read_c_triggered_#res; [L311] havoc is_do_read_c_triggered_~__retres1~1; [L71] havoc is_do_read_c_triggered_~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] is_do_read_c_triggered_~__retres1~1 := 0; [L86] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L311] activate_threads_#t~ret4 := is_do_read_c_triggered_#res; [L311] activate_threads_~tmp___0~1 := activate_threads_#t~ret4; [L311] havoc activate_threads_#t~ret4; [L313-L317] COND FALSE !(0 != activate_threads_~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] start_simulation_~kernel_st~0 := 1; [L413] havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0; [L323] havoc eval_~tmp~2; [L324] havoc eval_~tmp___0~2; [L325] havoc eval_~tmp___1~0; [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] eval_~tmp~2 := eval_#t~nondet6; [L341] havoc eval_#t~nondet6; [L343-L350] COND TRUE 0 != eval_~tmp~2 [L345] ~p_dw_st~0 := 1; [L346] havoc do_write_p_#t~nondet2; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := do_write_p_#t~nondet2; [L141] havoc do_write_p_#t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~q_buf_0~0 := 0; [L16] ~q_free~0 := 0; [L17] ~q_read_ev~0 := 0; [L18] ~q_write_ev~0 := 0; [L19] ~q_req_up~0 := 0; [L20] ~q_ev~0 := 0; [L41] ~p_num_write~0 := 0; [L42] ~p_last_write~0 := 0; [L43] ~p_dw_st~0 := 0; [L44] ~p_dw_pc~0 := 0; [L45] ~p_dw_i~0 := 0; [L46] ~c_num_read~0 := 0; [L47] ~c_last_read~0 := 0; [L48] ~c_dr_st~0 := 0; [L49] ~c_dr_pc~0 := 0; [L50] ~c_dr_i~0 := 0; [L154] ~a_t~0 := 0; [L456] havoc ~__retres1~3; [L442] ~q_free~0 := 1; [L443] ~q_write_ev~0 := 2; [L444] ~q_read_ev~0 := ~q_write_ev~0; [L445] ~p_num_write~0 := 0; [L446] ~p_dw_pc~0 := 0; [L447] ~p_dw_i~0 := 1; [L448] ~c_num_read~0 := 0; [L449] ~c_dr_pc~0 := 0; [L450] ~c_dr_i~0 := 1; [L396] havoc ~kernel_st~0; [L397] havoc ~tmp~4; [L401] ~kernel_st~0 := 0; [L212] COND FALSE !(1 == ~q_req_up~0) [L227] COND TRUE 1 == ~p_dw_i~0 [L228] ~p_dw_st~0 := 0; [L232] COND TRUE 1 == ~c_dr_i~0 [L233] ~c_dr_st~0 := 0; [L265] COND FALSE !(0 == ~q_read_ev~0) [L270] COND FALSE !(0 == ~q_write_ev~0) [L298] havoc ~tmp~1; [L299] havoc ~tmp___0~1; [L52] havoc ~__retres1~0; [L55] COND FALSE !(1 == ~p_dw_pc~0) [L65] ~__retres1~0 := 0; [L67] #res := ~__retres1~0; [L303] ~tmp~1 := #t~ret3; [L303] havoc #t~ret3; [L305-L309] COND FALSE !(0 != ~tmp~1) [L71] havoc ~__retres1~1; [L74] COND FALSE !(1 == ~c_dr_pc~0) [L84] ~__retres1~1 := 0; [L86] #res := ~__retres1~1; [L311] ~tmp___0~1 := #t~ret4; [L311] havoc #t~ret4; [L313-L317] COND FALSE !(0 != ~tmp___0~1) [L283] COND FALSE !(1 == ~q_read_ev~0) [L288] COND FALSE !(1 == ~q_write_ev~0) [L409-L431] COND FALSE !(false) [L412] ~kernel_st~0 := 1; [L323] havoc ~tmp~2; [L324] havoc ~tmp___0~2; [L325] havoc ~tmp___1~0; [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND TRUE 0 == ~p_dw_st~0 [L246] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND TRUE 0 == ~p_dw_st~0 [L341] ~tmp~2 := #t~nondet6; [L341] havoc #t~nondet6; [L343-L350] COND TRUE 0 != ~tmp~2 [L345] ~p_dw_st~0 := 1; [L118] COND TRUE 0 == ~p_dw_pc~0 [L129-L147] COND FALSE !(false) [L131] COND FALSE !(0 == ~q_free~0) [L141] ~q_buf_0~0 := #t~nondet2; [L141] havoc #t~nondet2; [L142] ~p_last_write~0 := ~q_buf_0~0; [L143] ~p_num_write~0 := 1 + ~p_num_write~0; [L144] ~q_free~0 := 0; [L145] ~q_req_up~0 := 1; [L129-L147] COND FALSE !(false) [L131] COND TRUE 0 == ~q_free~0 [L132] ~p_dw_st~0 := 2; [L133] ~p_dw_pc~0 := 1; [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; [?] assume !(0 != eval_~tmp___0~2); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L354-L368] assume 0 == ~c_dr_st~0; [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] assume !(0 != eval_~tmp___0~2); [L329-L369] assume !false; [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245-L255] assume !(0 == ~p_dw_st~0); [L249-L254] assume 0 == ~c_dr_st~0; [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] assume 0 != eval_~tmp___1~0; [L339-L353] assume !(0 == ~p_dw_st~0); [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] eval_~tmp___0~2 := eval_#t~nondet7; [L356] havoc eval_#t~nondet7; [L358-L365] COND FALSE !(0 != eval_~tmp___0~2) [L329-L369] COND FALSE !(false) [L332] havoc exists_runnable_thread_#res; [L332] havoc exists_runnable_thread_~__retres1~2; [L242] havoc exists_runnable_thread_~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] exists_runnable_thread_~__retres1~2 := 1; [L258] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L332] eval_#t~ret5 := exists_runnable_thread_#res; [L332] eval_~tmp___1~0 := eval_#t~ret5; [L332] havoc eval_#t~ret5; [L334-L338] COND TRUE 0 != eval_~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L354] COND TRUE 0 == ~c_dr_st~0 [L356] ~tmp___0~2 := #t~nondet7; [L356] havoc #t~nondet7; [L358-L365] COND FALSE !(0 != ~tmp___0~2) [L329-L369] COND FALSE !(false) [L242] havoc ~__retres1~2; [L245] COND FALSE !(0 == ~p_dw_st~0) [L249] COND TRUE 0 == ~c_dr_st~0 [L250] ~__retres1~2 := 1; [L258] #res := ~__retres1~2; [L332] ~tmp___1~0 := #t~ret5; [L332] havoc #t~ret5; [L334-L338] COND TRUE 0 != ~tmp___1~0 [L339] COND FALSE !(0 == ~p_dw_st~0) [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 Loop: [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...