./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/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 375e158327910cae8c3594f7d2ad0376509a1ecb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:55:02,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:55:02,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:55:02,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:55:02,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:55:02,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:55:02,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:55:02,630 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:55:02,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:55:02,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:55:02,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:55:02,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:55:02,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:55:02,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:55:02,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:55:02,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:55:02,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:55:02,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:55:02,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:55:02,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:55:02,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:55:02,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:55:02,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:55:02,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:55:02,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:55:02,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:55:02,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:55:02,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:55:02,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:55:02,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:55:02,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:55:02,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:55:02,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:55:02,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:55:02,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:55:02,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:55:02,646 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 00:55:02,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:55:02,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:55:02,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:55:02,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:55:02,656 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:55:02,656 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:55:02,656 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:55:02,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:55:02,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:55:02,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:55:02,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:55:02,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:55:02,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:55:02,660 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:55:02,660 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:55:02,660 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_f7af57ee-bbde-4cc0-9019-978f4d199898/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 -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2018-11-10 00:55:02,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:55:02,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:55:02,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:55:02,695 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:55:02,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:55:02,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-10 00:55:02,734 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/data/eabc829e7/045a83ec775d4b8b86490b0f473050f9/FLAGe671f95a5 [2018-11-10 00:55:03,142 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:55:03,142 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-10 00:55:03,149 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/data/eabc829e7/045a83ec775d4b8b86490b0f473050f9/FLAGe671f95a5 [2018-11-10 00:55:03,159 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/data/eabc829e7/045a83ec775d4b8b86490b0f473050f9 [2018-11-10 00:55:03,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:55:03,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:55:03,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:55:03,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:55:03,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:55:03,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377d388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03, skipping insertion in model container [2018-11-10 00:55:03,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:55:03,200 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:55:03,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:55:03,320 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:55:03,339 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:55:03,348 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:55:03,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03 WrapperNode [2018-11-10 00:55:03,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:55:03,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:55:03,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:55:03,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:55:03,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:55:03,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:55:03,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:55:03,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:55:03,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... [2018-11-10 00:55:03,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:55:03,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:55:03,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:55:03,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:55:03,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:55:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:55:03,684 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:55:03,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:03 BoogieIcfgContainer [2018-11-10 00:55:03,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:55:03,685 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:55:03,685 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:55:03,689 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:55:03,690 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:55:03,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:55:03" (1/3) ... [2018-11-10 00:55:03,691 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78d3ca8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:55:03, skipping insertion in model container [2018-11-10 00:55:03,691 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:55:03,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:03" (2/3) ... [2018-11-10 00:55:03,691 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78d3ca8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:55:03, skipping insertion in model container [2018-11-10 00:55:03,691 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:55:03,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:03" (3/3) ... [2018-11-10 00:55:03,693 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-10 00:55:03,737 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:55:03,738 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:55:03,738 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:55:03,738 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:55:03,738 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:55:03,738 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:55:03,738 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:55:03,738 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:55:03,738 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:55:03,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states. [2018-11-10 00:55:03,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-10 00:55:03,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:03,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:03,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,781 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:55:03,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states. [2018-11-10 00:55:03,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-10 00:55:03,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:03,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:03,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,790 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 85#L346true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 87#L196true assume !(~p_dw_i~0 == 1);~p_dw_st~0 := 2; 84#L196-2true assume !(~c_dr_i~0 == 1);~c_dr_st~0 := 2; 7#L201-1true assume { :end_inline_init_threads } true; 73#L313-3true [2018-11-10 00:55:03,791 INFO L795 eck$LassoCheckResult]: Loop: 73#L313-3true assume true; 69#L313-1true assume !false; 26#L314true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 72#L262true assume !true; 44#L278true assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 79#L214-1true assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 17#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 50#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 27#L292true assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 15#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 47#L300true start_simulation_#t~ret7 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 76#L320true assume !(start_simulation_~tmp~3 != 0); 73#L313-3true [2018-11-10 00:55:03,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2018-11-10 00:55:03,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:03,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:03,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:03,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:03,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:03,885 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:55:03,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1516117302, now seen corresponding path program 1 times [2018-11-10 00:55:03,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:03,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 00:55:03,891 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:03,902 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2018-11-10 00:55:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:03,915 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2018-11-10 00:55:03,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:03,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 110 transitions. [2018-11-10 00:55:03,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 00:55:03,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 75 states and 103 transitions. [2018-11-10 00:55:03,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 00:55:03,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 00:55:03,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 103 transitions. [2018-11-10 00:55:03,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:03,926 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 00:55:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 103 transitions. [2018-11-10 00:55:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 00:55:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 00:55:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2018-11-10 00:55:03,947 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 00:55:03,947 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 00:55:03,947 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:55:03,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 103 transitions. [2018-11-10 00:55:03,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 00:55:03,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:03,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:03,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:03,949 INFO L793 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 191#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 250#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 249#L196-2 assume !(~c_dr_i~0 == 1);~c_dr_st~0 := 2; 185#L201-1 assume { :end_inline_init_threads } true; 186#L313-3 [2018-11-10 00:55:03,949 INFO L795 eck$LassoCheckResult]: Loop: 186#L313-3 assume true; 246#L313-1 assume !false; 213#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 177#L262 assume true; 205#L237-1 assume !false; 206#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 239#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 207#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 208#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 221#L242 assume !(eval_~tmp___1~0 != 0); 222#L278 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 233#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 203#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 204#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 214#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 199#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 200#L300 start_simulation_#t~ret7 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 234#L320 assume !(start_simulation_~tmp~3 != 0); 186#L313-3 [2018-11-10 00:55:03,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2018-11-10 00:55:03,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:03,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:03,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:03,978 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:55:03,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1262855927, now seen corresponding path program 1 times [2018-11-10 00:55:03,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:03,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:03,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:04,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:55:04,020 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:04,020 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-10 00:55:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:04,027 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2018-11-10 00:55:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:04,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 102 transitions. [2018-11-10 00:55:04,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 00:55:04,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 102 transitions. [2018-11-10 00:55:04,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 00:55:04,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 00:55:04,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 102 transitions. [2018-11-10 00:55:04,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:04,031 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-11-10 00:55:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 102 transitions. [2018-11-10 00:55:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 00:55:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 00:55:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-11-10 00:55:04,034 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-11-10 00:55:04,034 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-11-10 00:55:04,034 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:55:04,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 102 transitions. [2018-11-10 00:55:04,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 00:55:04,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:04,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:04,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 00:55:04,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:04,036 INFO L793 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 349#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 350#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 409#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 408#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 344#L201-1 assume { :end_inline_init_threads } true; 345#L313-3 [2018-11-10 00:55:04,036 INFO L795 eck$LassoCheckResult]: Loop: 345#L313-3 assume true; 405#L313-1 assume !false; 372#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 336#L262 assume true; 364#L237-1 assume !false; 365#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 398#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 366#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 367#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 380#L242 assume !(eval_~tmp___1~0 != 0); 381#L278 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 391#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 362#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 363#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 373#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 358#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 359#L300 start_simulation_#t~ret7 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 393#L320 assume !(start_simulation_~tmp~3 != 0); 345#L313-3 [2018-11-10 00:55:04,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2018-11-10 00:55:04,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1262855927, now seen corresponding path program 2 times [2018-11-10 00:55:04,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:04,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:55:04,103 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:55:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:55:04,103 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-11-10 00:55:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:04,157 INFO L93 Difference]: Finished difference Result 148 states and 199 transitions. [2018-11-10 00:55:04,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 00:55:04,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 199 transitions. [2018-11-10 00:55:04,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2018-11-10 00:55:04,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 199 transitions. [2018-11-10 00:55:04,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-11-10 00:55:04,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-11-10 00:55:04,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 199 transitions. [2018-11-10 00:55:04,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:04,162 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 199 transitions. [2018-11-10 00:55:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 199 transitions. [2018-11-10 00:55:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2018-11-10 00:55:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 00:55:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2018-11-10 00:55:04,165 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 105 transitions. [2018-11-10 00:55:04,165 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 105 transitions. [2018-11-10 00:55:04,165 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 00:55:04,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 105 transitions. [2018-11-10 00:55:04,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2018-11-10 00:55:04,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:04,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:04,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 00:55:04,166 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] [2018-11-10 00:55:04,167 INFO L793 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 588#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 589#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 649#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 648#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 583#L201-1 assume { :end_inline_init_threads } true; 584#L313-3 [2018-11-10 00:55:04,167 INFO L795 eck$LassoCheckResult]: Loop: 584#L313-3 assume true; 645#L313-1 assume !false; 611#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 575#L262 assume true; 603#L237-1 assume !false; 604#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 637#L214 assume !(~p_dw_st~0 == 0); 643#L218 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 644#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 651#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 650#L242 assume !(eval_~tmp___1~0 != 0); 629#L278 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 630#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 601#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 602#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 612#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 599#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 600#L300 start_simulation_#t~ret7 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 632#L320 assume !(start_simulation_~tmp~3 != 0); 584#L313-3 [2018-11-10 00:55:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2018-11-10 00:55:04,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -72914089, now seen corresponding path program 1 times [2018-11-10 00:55:04,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:04,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:04,194 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:04,194 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-10 00:55:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:04,211 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-10 00:55:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:04,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 168 transitions. [2018-11-10 00:55:04,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2018-11-10 00:55:04,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 128 states and 168 transitions. [2018-11-10 00:55:04,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2018-11-10 00:55:04,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-10 00:55:04,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 168 transitions. [2018-11-10 00:55:04,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:04,215 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 168 transitions. [2018-11-10 00:55:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 168 transitions. [2018-11-10 00:55:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-11-10 00:55:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 00:55:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2018-11-10 00:55:04,220 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 143 transitions. [2018-11-10 00:55:04,220 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 143 transitions. [2018-11-10 00:55:04,220 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 00:55:04,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 143 transitions. [2018-11-10 00:55:04,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 00:55:04,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:04,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:04,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:04,221 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] [2018-11-10 00:55:04,222 INFO L793 eck$LassoCheckResult]: Stem: 841#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 800#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 801#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 875#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 874#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 795#L201-1 assume { :end_inline_init_threads } true; 796#L313-3 assume true; 866#L313-1 assume !false; 867#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 881#L262 [2018-11-10 00:55:04,222 INFO L795 eck$LassoCheckResult]: Loop: 881#L262 assume true; 880#L237-1 assume !false; 853#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 854#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 817#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 818#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 879#L242 assume eval_~tmp___1~0 != 0; 877#L242-1 assume !(~p_dw_st~0 == 0); 830#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 804#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 805#L139 assume !(~c_dr_pc~0 == 0); 820#L142 assume ~c_dr_pc~0 == 1; 821#L143 do_read_c_~a~0 := ~a_t~0; 826#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 895#L32-3 assume ~p_dw_pc~0 == 1; 893#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 892#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 891#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 890#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 832#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 788#L51-3 assume !(~c_dr_pc~0 == 1); 789#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 823#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 835#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 836#L82-3 assume immediate_notify_threads_~tmp___0~0 != 0;~c_dr_st~0 := 0; 861#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 862#L172 assume ~p_last_write~0 == ~c_last_read~0; 887#L173 assume ~p_num_write~0 == ~c_num_read~0; 886#L172-1 assume true; 885#L150 assume !false; 883#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 882#L186 assume { :end_inline_do_read_c } true; 881#L262 [2018-11-10 00:55:04,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 1 times [2018-11-10 00:55:04,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 359715650, now seen corresponding path program 1 times [2018-11-10 00:55:04,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:04,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:04,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:04,256 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:04,256 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-11-10 00:55:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:04,272 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-10 00:55:04,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:04,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 166 transitions. [2018-11-10 00:55:04,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2018-11-10 00:55:04,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 128 states and 166 transitions. [2018-11-10 00:55:04,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2018-11-10 00:55:04,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-10 00:55:04,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 166 transitions. [2018-11-10 00:55:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:04,275 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 166 transitions. [2018-11-10 00:55:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 166 transitions. [2018-11-10 00:55:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-11-10 00:55:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 00:55:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-11-10 00:55:04,280 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-10 00:55:04,280 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-10 00:55:04,280 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 00:55:04,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2018-11-10 00:55:04,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 00:55:04,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:04,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:04,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:04,282 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, 1, 1] [2018-11-10 00:55:04,282 INFO L793 eck$LassoCheckResult]: Stem: 1084#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 1044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 1045#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 1113#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 1112#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 1039#L201-1 assume { :end_inline_init_threads } true; 1040#L313-3 assume true; 1107#L313-1 assume !false; 1068#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1031#L262 [2018-11-10 00:55:04,283 INFO L795 eck$LassoCheckResult]: Loop: 1031#L262 assume true; 1060#L237-1 assume !false; 1061#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1098#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 1111#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1120#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1076#L242 assume eval_~tmp___1~0 != 0; 1072#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1073#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 1102#L96 assume ~p_dw_pc~0 == 0; 1080#L107-2 assume true; 1081#L107 assume !false; 1103#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 1085#L128 assume { :end_inline_do_write_p } true; 1086#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 1048#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 1049#L139 assume !(~c_dr_pc~0 == 0); 1065#L142 assume ~c_dr_pc~0 == 1; 1066#L143 do_read_c_~a~0 := ~a_t~0; 1070#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1108#L32-3 assume ~p_dw_pc~0 == 1; 1082#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 1046#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1047#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1074#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 1075#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1133#L51-3 assume ~c_dr_pc~0 == 1; 1131#L52-1 assume ~q_write_ev~0 == 1;is_do_read_c_triggered_~__retres1~1 := 1; 1130#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1078#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1079#L82-3 assume immediate_notify_threads_~tmp___0~0 != 0;~c_dr_st~0 := 0; 1099#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 1094#L172 assume ~p_last_write~0 == ~c_last_read~0; 1095#L173 assume ~p_num_write~0 == ~c_num_read~0; 1087#L172-1 assume true; 1088#L150 assume !false; 1089#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 1030#L186 assume { :end_inline_do_read_c } true; 1031#L262 [2018-11-10 00:55:04,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 2 times [2018-11-10 00:55:04,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash -228983864, now seen corresponding path program 1 times [2018-11-10 00:55:04,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:04,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -375124652, now seen corresponding path program 1 times [2018-11-10 00:55:04,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:04,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:04,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:04,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:04,519 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-10 00:55:04,610 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:55:04,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:55:04,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:55:04,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:55:04,611 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:55:04,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:55:04,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:55:04,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 00:55:04,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:55:04,612 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:55:04,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,868 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:55:04,868 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:55:04,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:55:04,882 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:55:04,882 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=-3, ULTIMATE.start_eval_~tmp~1=-3} Honda state: {ULTIMATE.start_eval_#t~nondet4=-3, ULTIMATE.start_eval_~tmp~1=-3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:55:04,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:55:04,915 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:55:04,915 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_read_ev~0=2} Honda state: {~q_read_ev~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:55:04,920 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:55:04,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:55:04,956 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:55:04,980 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:55:04,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:55:04,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:55:04,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:55:04,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:55:04,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:55:04,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:55:04,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:55:04,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 00:55:04,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:55:04,981 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:55:04,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:04,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:55:05,259 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:55:05,264 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:55:05,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:55:05,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:55:05,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:55:05,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:55:05,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:55:05,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:55:05,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:55:05,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:55:05,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:55:05,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:55:05,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:55:05,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:55:05,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:55:05,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:55:05,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:55:05,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:55:05,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:55:05,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:55:05,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:55:05,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:55:05,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:55:05,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:55:05,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:55:05,308 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:55:05,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:55:05,311 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 00:55:05,312 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:55:05,313 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:55:05,313 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:55:05,313 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = -2*~q_free~0 + 1 Supporting invariants [] [2018-11-10 00:55:05,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:55:05,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:55:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:55:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 00:55:05,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 141 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-10 00:55:05,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 141 transitions. cyclomatic complexity: 32. Second operand 5 states. Result 342 states and 433 transitions. Complement of second has 7 states. [2018-11-10 00:55:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:55:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:55:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2018-11-10 00:55:05,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 9 letters. Loop has 38 letters. [2018-11-10 00:55:05,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:55:05,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 47 letters. Loop has 38 letters. [2018-11-10 00:55:05,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:55:05,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 9 letters. Loop has 76 letters. [2018-11-10 00:55:05,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:55:05,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 433 transitions. [2018-11-10 00:55:05,555 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 159 [2018-11-10 00:55:05,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 289 states and 364 transitions. [2018-11-10 00:55:05,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2018-11-10 00:55:05,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2018-11-10 00:55:05,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 364 transitions. [2018-11-10 00:55:05,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:55:05,557 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 364 transitions. [2018-11-10 00:55:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 364 transitions. [2018-11-10 00:55:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 239. [2018-11-10 00:55:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 00:55:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2018-11-10 00:55:05,567 INFO L728 BuchiCegarLoop]: Abstraction has 239 states and 302 transitions. [2018-11-10 00:55:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,568 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand 3 states. [2018-11-10 00:55:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,578 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2018-11-10 00:55:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:05,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 217 transitions. [2018-11-10 00:55:05,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-10 00:55:05,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 161 states and 203 transitions. [2018-11-10 00:55:05,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2018-11-10 00:55:05,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2018-11-10 00:55:05,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 203 transitions. [2018-11-10 00:55:05,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,582 INFO L705 BuchiCegarLoop]: Abstraction has 161 states and 203 transitions. [2018-11-10 00:55:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 203 transitions. [2018-11-10 00:55:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-11-10 00:55:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 00:55:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2018-11-10 00:55:05,585 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 144 transitions. [2018-11-10 00:55:05,585 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 144 transitions. [2018-11-10 00:55:05,588 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 00:55:05,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 144 transitions. [2018-11-10 00:55:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2018-11-10 00:55:05,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,590 INFO L793 eck$LassoCheckResult]: Stem: 2118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 2077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 2078#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 2157#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 2156#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 2072#L201-1 assume { :end_inline_init_threads } true; 2073#L313-3 assume true; 2172#L313-1 assume !false; 2170#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2168#L262 [2018-11-10 00:55:05,591 INFO L795 eck$LassoCheckResult]: Loop: 2168#L262 assume true; 2167#L237-1 assume !false; 2166#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2165#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2094#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2095#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2111#L242 assume eval_~tmp___1~0 != 0; 2107#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2108#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 2141#L96 assume !(~p_dw_pc~0 == 0); 2134#L99 assume ~p_dw_pc~0 == 1; 2096#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2083#L32 assume ~p_dw_pc~0 == 1; 2084#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2086#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2087#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2130#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 2112#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2074#L51 assume !(~c_dr_pc~0 == 1); 2068#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2069#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2076#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2140#L82 assume immediate_notify_threads_~tmp___0~0 != 0;~c_dr_st~0 := 0; 2138#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 2139#L107-2 assume true; 2159#L107 assume !false; 2158#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 2119#L128 assume { :end_inline_do_write_p } true; 2120#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 2081#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 2082#L139 assume !(~c_dr_pc~0 == 0); 2097#L142 assume ~c_dr_pc~0 == 1; 2098#L143 do_read_c_~a~0 := ~a_t~0; 2104#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2150#L32-3 assume ~p_dw_pc~0 == 1; 2151#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2079#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2080#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2109#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 2105#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2106#L51-3 assume ~c_dr_pc~0 == 1; 2113#L52-1 assume ~q_write_ev~0 == 1;is_do_read_c_triggered_~__retres1~1 := 1; 2101#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2114#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2115#L82-3 assume immediate_notify_threads_~tmp___0~0 != 0;~c_dr_st~0 := 0; 2143#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 2144#L172 assume ~p_last_write~0 == ~c_last_read~0; 2175#L173 assume ~p_num_write~0 == ~c_num_read~0; 2174#L172-1 assume true; 2173#L150 assume !false; 2171#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 2169#L186 assume { :end_inline_do_read_c } true; 2168#L262 [2018-11-10 00:55:05,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 3 times [2018-11-10 00:55:05,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 562618161, now seen corresponding path program 1 times [2018-11-10 00:55:05,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:05,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:55:05,636 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:55:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:55:05,636 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-10 00:55:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,688 INFO L93 Difference]: Finished difference Result 273 states and 339 transitions. [2018-11-10 00:55:05,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:55:05,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 339 transitions. [2018-11-10 00:55:05,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 264 [2018-11-10 00:55:05,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 273 states and 339 transitions. [2018-11-10 00:55:05,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2018-11-10 00:55:05,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 273 [2018-11-10 00:55:05,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 339 transitions. [2018-11-10 00:55:05,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,692 INFO L705 BuchiCegarLoop]: Abstraction has 273 states and 339 transitions. [2018-11-10 00:55:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 339 transitions. [2018-11-10 00:55:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 122. [2018-11-10 00:55:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-10 00:55:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2018-11-10 00:55:05,696 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-11-10 00:55:05,696 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-11-10 00:55:05,696 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 00:55:05,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 153 transitions. [2018-11-10 00:55:05,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2018-11-10 00:55:05,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,698 INFO L793 eck$LassoCheckResult]: Stem: 2515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 2477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 2478#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 2549#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 2548#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 2472#L201-1 assume { :end_inline_init_threads } true; 2473#L313-3 assume true; 2544#L313-1 assume !false; 2502#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2464#L262 [2018-11-10 00:55:05,698 INFO L795 eck$LassoCheckResult]: Loop: 2464#L262 assume true; 2493#L237-1 assume !false; 2494#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2530#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2495#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2496#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2509#L242 assume eval_~tmp___1~0 != 0; 2506#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2507#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 2538#L96 assume !(~p_dw_pc~0 == 0); 2529#L99 assume ~p_dw_pc~0 == 1; 2497#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2484#L32 assume ~p_dw_pc~0 == 1; 2485#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2487#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2488#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2525#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 2510#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2474#L51 assume !(~c_dr_pc~0 == 1); 2468#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2469#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2476#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2535#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 2533#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 2534#L107-2 assume true; 2554#L107 assume !false; 2552#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 2516#L128 assume { :end_inline_do_write_p } true; 2517#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 2479#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 2480#L139 assume !(~c_dr_pc~0 == 0); 2498#L142 assume ~c_dr_pc~0 == 1; 2499#L143 do_read_c_~a~0 := ~a_t~0; 2504#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2583#L32-3 assume ~p_dw_pc~0 == 1; 2581#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2580#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2579#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2578#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 2505#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2465#L51-3 assume !(~c_dr_pc~0 == 1); 2466#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 2501#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2584#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2531#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 2532#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 2527#L172 assume ~p_last_write~0 == ~c_last_read~0; 2528#L173 assume ~p_num_write~0 == ~c_num_read~0; 2520#L172-1 assume true; 2521#L150 assume !false; 2522#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 2463#L186 assume { :end_inline_do_read_c } true; 2464#L262 [2018-11-10 00:55:05,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 4 times [2018-11-10 00:55:05,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1512290740, now seen corresponding path program 1 times [2018-11-10 00:55:05,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,723 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,724 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-10 00:55:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,744 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2018-11-10 00:55:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:05,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 272 transitions. [2018-11-10 00:55:05,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 197 [2018-11-10 00:55:05,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 272 transitions. [2018-11-10 00:55:05,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-11-10 00:55:05,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-11-10 00:55:05,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 272 transitions. [2018-11-10 00:55:05,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,748 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 272 transitions. [2018-11-10 00:55:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 272 transitions. [2018-11-10 00:55:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-10 00:55:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 00:55:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 272 transitions. [2018-11-10 00:55:05,752 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 272 transitions. [2018-11-10 00:55:05,752 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 272 transitions. [2018-11-10 00:55:05,753 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 00:55:05,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 272 transitions. [2018-11-10 00:55:05,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 197 [2018-11-10 00:55:05,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,754 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] [2018-11-10 00:55:05,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,754 INFO L793 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 2824#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 2825#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 2910#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 2909#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 2819#L201-1 assume { :end_inline_init_threads } true; 2820#L313-3 assume true; 2902#L313-1 assume !false; 2848#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2849#L262 assume true; 2840#L237-1 assume !false; 2841#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2889#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2906#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2984#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2859#L242 assume eval_~tmp___1~0 != 0; 2855#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2856#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 2893#L96 assume !(~p_dw_pc~0 == 0); 2887#L99 assume ~p_dw_pc~0 == 1; 2844#L109 [2018-11-10 00:55:05,755 INFO L795 eck$LassoCheckResult]: Loop: 2844#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2831#L32 assume ~p_dw_pc~0 == 1; 2832#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2834#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2835#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2882#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 2860#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2821#L51 assume !(~c_dr_pc~0 == 1); 2822#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2936#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2934#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2933#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 2929#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 2927#L107-2 assume true; 2925#L107 assume !false; 2922#L108 assume !(~q_free~0 == 0); 2844#L109 [2018-11-10 00:55:05,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash 772530409, now seen corresponding path program 1 times [2018-11-10 00:55:05,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,775 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:55:05,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 144680713, now seen corresponding path program 1 times [2018-11-10 00:55:05,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 00:55:05,786 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,787 INFO L87 Difference]: Start difference. First operand 220 states and 272 transitions. cyclomatic complexity: 53 Second operand 3 states. [2018-11-10 00:55:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,796 INFO L93 Difference]: Finished difference Result 254 states and 312 transitions. [2018-11-10 00:55:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:05,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 312 transitions. [2018-11-10 00:55:05,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 00:55:05,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 312 transitions. [2018-11-10 00:55:05,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-10 00:55:05,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-10 00:55:05,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 312 transitions. [2018-11-10 00:55:05,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,800 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 312 transitions. [2018-11-10 00:55:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 312 transitions. [2018-11-10 00:55:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-11-10 00:55:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 00:55:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 309 transitions. [2018-11-10 00:55:05,804 INFO L728 BuchiCegarLoop]: Abstraction has 251 states and 309 transitions. [2018-11-10 00:55:05,804 INFO L608 BuchiCegarLoop]: Abstraction has 251 states and 309 transitions. [2018-11-10 00:55:05,804 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 00:55:05,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 309 transitions. [2018-11-10 00:55:05,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2018-11-10 00:55:05,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,806 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] [2018-11-10 00:55:05,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,806 INFO L793 eck$LassoCheckResult]: Stem: 3350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 3305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 3306#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 3386#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 3385#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 3300#L201-1 assume { :end_inline_init_threads } true; 3301#L313-3 assume true; 3423#L313-1 assume !false; 3421#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 3419#L262 assume true; 3414#L237-1 assume !false; 3411#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3408#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3407#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3406#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 3405#L242 assume eval_~tmp___1~0 != 0; 3404#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 3403#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 3401#L96 assume !(~p_dw_pc~0 == 0); 3398#L99 assume ~p_dw_pc~0 == 1; 3324#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3311#L32 assume ~p_dw_pc~0 == 1; 3312#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 3316#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3317#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 3359#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 3338#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3302#L51 assume !(~c_dr_pc~0 == 1); 3303#L51-2 [2018-11-10 00:55:05,806 INFO L795 eck$LassoCheckResult]: Loop: 3303#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 3477#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3475#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 3473#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 3366#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 3342#L107-2 assume true; 3343#L107 assume !false; 3464#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 3346#L128 assume { :end_inline_do_write_p } true; 3347#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 3431#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 3432#L139 assume ~c_dr_pc~0 == 0; 3412#L172-1 assume true; 3410#L150 assume !false; 3372#L151 assume !(~q_free~0 == 1); 3373#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3380#L32-3 assume ~p_dw_pc~0 == 1; 3348#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 3309#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3310#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 3335#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 3336#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3488#L51-3 assume !(~c_dr_pc~0 == 1); 3462#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 3487#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3485#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 3483#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 3374#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 3357#L172 assume ~p_last_write~0 == ~c_last_read~0; 3358#L173 assume ~p_num_write~0 == ~c_num_read~0; 3351#L172-1 assume true; 3352#L150 assume !false; 3353#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 3396#L186 assume { :end_inline_do_read_c } true; 3427#L262 assume true; 3426#L237-1 assume !false; 3425#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3424#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3422#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3420#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 3418#L242 assume eval_~tmp___1~0 != 0; 3413#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 3379#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 3369#L96 assume !(~p_dw_pc~0 == 0); 3361#L99 assume ~p_dw_pc~0 == 1; 3362#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3394#L32 assume ~p_dw_pc~0 == 1; 3392#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 3391#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3390#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 3389#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 3388#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3387#L51 assume !(~c_dr_pc~0 == 1); 3303#L51-2 [2018-11-10 00:55:05,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2100654429, now seen corresponding path program 1 times [2018-11-10 00:55:05,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,835 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:55:05,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,835 INFO L82 PathProgramCache]: Analyzing trace with hash -325464447, now seen corresponding path program 1 times [2018-11-10 00:55:05,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,855 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,856 INFO L87 Difference]: Start difference. First operand 251 states and 309 transitions. cyclomatic complexity: 59 Second operand 3 states. [2018-11-10 00:55:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,870 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2018-11-10 00:55:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:05,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 338 transitions. [2018-11-10 00:55:05,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2018-11-10 00:55:05,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 280 states and 338 transitions. [2018-11-10 00:55:05,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 280 [2018-11-10 00:55:05,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2018-11-10 00:55:05,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 338 transitions. [2018-11-10 00:55:05,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,875 INFO L705 BuchiCegarLoop]: Abstraction has 280 states and 338 transitions. [2018-11-10 00:55:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 338 transitions. [2018-11-10 00:55:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 254. [2018-11-10 00:55:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 00:55:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 308 transitions. [2018-11-10 00:55:05,878 INFO L728 BuchiCegarLoop]: Abstraction has 254 states and 308 transitions. [2018-11-10 00:55:05,878 INFO L608 BuchiCegarLoop]: Abstraction has 254 states and 308 transitions. [2018-11-10 00:55:05,878 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 00:55:05,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 308 transitions. [2018-11-10 00:55:05,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-10 00:55:05,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,880 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] [2018-11-10 00:55:05,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,880 INFO L793 eck$LassoCheckResult]: Stem: 3891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 3843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 3844#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 3936#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 3934#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 3838#L201-1 assume { :end_inline_init_threads } true; 3839#L313-3 assume true; 4070#L313-1 assume !false; 4069#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4068#L262 assume true; 4067#L237-1 assume !false; 4066#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3930#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3931#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4071#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 3877#L242 assume eval_~tmp___1~0 != 0; 3873#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 3874#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 3914#L96 assume ~p_dw_pc~0 == 0; 3915#L107-2 assume true; 3971#L107 assume !false; 3967#L108 assume !(~q_free~0 == 0); 3968#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4044#L32 assume !(~p_dw_pc~0 == 1); 4042#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 4041#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4040#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4038#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 4037#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3840#L51 assume !(~c_dr_pc~0 == 1); 3841#L51-2 [2018-11-10 00:55:05,881 INFO L795 eck$LassoCheckResult]: Loop: 3841#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4017#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3977#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 3963#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 3961#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 3959#L107-2 assume true; 3957#L107 assume !false; 3955#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 3950#L128 assume { :end_inline_do_write_p } true; 3947#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 3943#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 3941#L139 assume ~c_dr_pc~0 == 0; 3863#L172-1 assume true; 3894#L150 assume !false; 3895#L151 assume !(~q_free~0 == 1); 3917#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3933#L32-3 assume ~p_dw_pc~0 == 1; 3889#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 3847#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3848#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 3875#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 3876#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4026#L51-3 assume !(~c_dr_pc~0 == 1); 3988#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 4021#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4018#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 3982#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 3975#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 3976#L172 assume ~p_last_write~0 == ~c_last_read~0; 4009#L173 assume ~p_num_write~0 == ~c_num_read~0; 4007#L172-1 assume true; 4006#L150 assume !false; 3965#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 3964#L186 assume { :end_inline_do_read_c } true; 3962#L262 assume true; 3960#L237-1 assume !false; 3958#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3956#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3954#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3952#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 3949#L242 assume eval_~tmp___1~0 != 0; 3946#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 3942#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 3938#L96 assume !(~p_dw_pc~0 == 0); 3906#L99 assume ~p_dw_pc~0 == 1; 3907#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3937#L32 assume ~p_dw_pc~0 == 1; 3898#L33 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 3853#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3854#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 3902#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 3878#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3879#L51 assume !(~c_dr_pc~0 == 1); 3841#L51-2 [2018-11-10 00:55:05,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1571429197, now seen corresponding path program 1 times [2018-11-10 00:55:05,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -325464447, now seen corresponding path program 2 times [2018-11-10 00:55:05,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,911 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,912 INFO L87 Difference]: Start difference. First operand 254 states and 308 transitions. cyclomatic complexity: 55 Second operand 3 states. [2018-11-10 00:55:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:05,939 INFO L93 Difference]: Finished difference Result 254 states and 307 transitions. [2018-11-10 00:55:05,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:05,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 307 transitions. [2018-11-10 00:55:05,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-10 00:55:05,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 307 transitions. [2018-11-10 00:55:05,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-10 00:55:05,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-10 00:55:05,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 307 transitions. [2018-11-10 00:55:05,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:05,944 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 307 transitions. [2018-11-10 00:55:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 307 transitions. [2018-11-10 00:55:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-10 00:55:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 00:55:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2018-11-10 00:55:05,948 INFO L728 BuchiCegarLoop]: Abstraction has 254 states and 307 transitions. [2018-11-10 00:55:05,948 INFO L608 BuchiCegarLoop]: Abstraction has 254 states and 307 transitions. [2018-11-10 00:55:05,948 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 00:55:05,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 307 transitions. [2018-11-10 00:55:05,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-10 00:55:05,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:05,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:05,950 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] [2018-11-10 00:55:05,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:05,950 INFO L793 eck$LassoCheckResult]: Stem: 4403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 4357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 4358#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 4456#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 4454#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 4352#L201-1 assume { :end_inline_init_threads } true; 4353#L313-3 assume true; 4514#L313-1 assume !false; 4513#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4511#L262 assume true; 4510#L237-1 assume !false; 4509#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4508#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4506#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4505#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4388#L242 assume eval_~tmp___1~0 != 0; 4385#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4386#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 4435#L96 assume ~p_dw_pc~0 == 0; 4394#L107-2 assume true; 4395#L107 assume !false; 4436#L108 assume !(~q_free~0 == 0); 4452#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4486#L32 assume !(~p_dw_pc~0 == 1); 4449#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 4366#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4367#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4416#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 4389#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4354#L51 assume !(~c_dr_pc~0 == 1); 4355#L51-2 [2018-11-10 00:55:05,950 INFO L795 eck$LassoCheckResult]: Loop: 4355#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4495#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4492#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4489#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 4487#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 4484#L107-2 assume true; 4463#L107 assume !false; 4461#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 4462#L128 assume { :end_inline_do_write_p } true; 4473#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 4469#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 4466#L139 assume ~c_dr_pc~0 == 0; 4378#L172-1 assume true; 4504#L150 assume !false; 4437#L151 assume !(~q_free~0 == 1); 4438#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4597#L32-3 assume ~p_dw_pc~0 == 1; 4595#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 4594#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4409#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4410#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 4384#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4346#L51-3 assume !(~c_dr_pc~0 == 1); 4347#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 4350#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4351#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4393#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 4429#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 4419#L172 assume ~p_last_write~0 == ~c_last_read~0; 4420#L173 assume ~p_num_write~0 == ~c_num_read~0; 4407#L172-1 assume true; 4408#L150 assume !false; 4464#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 4465#L186 assume { :end_inline_do_read_c } true; 4493#L262 assume true; 4490#L237-1 assume !false; 4488#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4485#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4483#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4478#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4475#L242 assume eval_~tmp___1~0 != 0; 4471#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4467#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 4458#L96 assume !(~p_dw_pc~0 == 0); 4425#L99 assume ~p_dw_pc~0 == 1; 4426#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4457#L32 assume !(~p_dw_pc~0 == 1); 4365#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 4479#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4476#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4472#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 4468#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4460#L51 assume !(~c_dr_pc~0 == 1); 4355#L51-2 [2018-11-10 00:55:05,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1571429197, now seen corresponding path program 2 times [2018-11-10 00:55:05,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:05,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1763868930, now seen corresponding path program 1 times [2018-11-10 00:55:05,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 00:55:05,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:55:05,991 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:05,992 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-11-10 00:55:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:06,018 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2018-11-10 00:55:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:06,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 300 transitions. [2018-11-10 00:55:06,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2018-11-10 00:55:06,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 300 transitions. [2018-11-10 00:55:06,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-10 00:55:06,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-10 00:55:06,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 300 transitions. [2018-11-10 00:55:06,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:06,022 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 300 transitions. [2018-11-10 00:55:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 300 transitions. [2018-11-10 00:55:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2018-11-10 00:55:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-10 00:55:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 292 transitions. [2018-11-10 00:55:06,025 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 292 transitions. [2018-11-10 00:55:06,025 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 292 transitions. [2018-11-10 00:55:06,025 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 00:55:06,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 292 transitions. [2018-11-10 00:55:06,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2018-11-10 00:55:06,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:06,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:06,027 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] [2018-11-10 00:55:06,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,027 INFO L793 eck$LassoCheckResult]: Stem: 4915#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 4870#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 4871#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 4962#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 4960#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 4866#L201-1 assume { :end_inline_init_threads } true; 4867#L313-3 assume true; 5039#L313-1 assume !false; 5038#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5037#L262 assume true; 5036#L237-1 assume !false; 5034#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5031#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 5028#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5026#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4900#L242 assume eval_~tmp___1~0 != 0; 4897#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4898#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 4937#L96 assume ~p_dw_pc~0 == 0; 4938#L107-2 assume true; 4967#L107 assume !false; 4966#L108 assume !(~q_free~0 == 0); 4889#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4877#L32 assume !(~p_dw_pc~0 == 1); 4878#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 4879#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4880#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4924#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 4901#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4868#L51 assume !(~c_dr_pc~0 == 1); 4862#L51-2 [2018-11-10 00:55:06,027 INFO L795 eck$LassoCheckResult]: Loop: 4862#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4863#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4869#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4936#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 4935#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 4906#L107-2 assume true; 4907#L107 assume !false; 4939#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 4958#L128 assume { :end_inline_do_write_p } true; 4977#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 4973#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 4970#L139 assume ~c_dr_pc~0 == 0; 4891#L172-1 assume true; 5033#L150 assume !false; 4940#L151 assume !(~q_free~0 == 1); 4941#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5102#L32-3 assume ~p_dw_pc~0 == 1; 5100#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 5099#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5098#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 5097#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 4896#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4860#L51-3 assume !(~c_dr_pc~0 == 1); 4861#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 4864#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4865#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4905#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 4934#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 5056#L172 assume ~p_last_write~0 == ~c_last_read~0; 4943#L173 assume ~p_num_write~0 == ~c_num_read~0; 4944#L172-1 assume true; 5067#L150 assume !false; 4968#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 4969#L186 assume { :end_inline_do_read_c } true; 4994#L262 assume true; 4991#L237-1 assume !false; 4989#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4987#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4985#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4981#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4978#L242 assume eval_~tmp___1~0 != 0; 4975#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4971#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 4964#L96 assume !(~p_dw_pc~0 == 0); 4930#L99 assume ~p_dw_pc~0 == 1; 4931#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4963#L32 assume ~p_dw_pc~0 == 1; 4922#L33 assume !(~q_read_ev~0 == 1); 4923#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 4982#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4979#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4976#L74 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 4972#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4965#L51 assume !(~c_dr_pc~0 == 1); 4862#L51-2 [2018-11-10 00:55:06,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1571429197, now seen corresponding path program 3 times [2018-11-10 00:55:06,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 216345356, now seen corresponding path program 1 times [2018-11-10 00:55:06,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 00:55:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:55:06,076 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:55:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:55:06,077 INFO L87 Difference]: Start difference. First operand 246 states and 292 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-11-10 00:55:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:06,104 INFO L93 Difference]: Finished difference Result 404 states and 471 transitions. [2018-11-10 00:55:06,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:55:06,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 471 transitions. [2018-11-10 00:55:06,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 374 [2018-11-10 00:55:06,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 404 states and 471 transitions. [2018-11-10 00:55:06,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 404 [2018-11-10 00:55:06,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 404 [2018-11-10 00:55:06,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 471 transitions. [2018-11-10 00:55:06,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:06,109 INFO L705 BuchiCegarLoop]: Abstraction has 404 states and 471 transitions. [2018-11-10 00:55:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 471 transitions. [2018-11-10 00:55:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 258. [2018-11-10 00:55:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 00:55:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-10 00:55:06,113 INFO L728 BuchiCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-10 00:55:06,113 INFO L608 BuchiCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-10 00:55:06,113 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 00:55:06,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 302 transitions. [2018-11-10 00:55:06,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 228 [2018-11-10 00:55:06,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:06,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:06,114 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] [2018-11-10 00:55:06,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,115 INFO L793 eck$LassoCheckResult]: Stem: 5580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 5535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 5536#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 5622#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 5621#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 5530#L201-1 assume { :end_inline_init_threads } true; 5531#L313-3 assume true; 5648#L313-1 assume !false; 5647#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5646#L262 assume true; 5645#L237-1 assume !false; 5644#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5643#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 5642#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5641#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5640#L242 assume eval_~tmp___1~0 != 0; 5639#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5638#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 5637#L96 assume ~p_dw_pc~0 == 0; 5635#L107-2 assume true; 5633#L107 assume !false; 5618#L108 assume !(~q_free~0 == 0); 5554#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5542#L32 assume !(~p_dw_pc~0 == 1); 5543#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 5544#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5545#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 5590#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 5567#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5532#L51 assume !(~c_dr_pc~0 == 1); 5526#L51-2 [2018-11-10 00:55:06,115 INFO L795 eck$LassoCheckResult]: Loop: 5526#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 5527#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5602#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 5603#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 5598#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 5599#L107-2 assume true; 5605#L107 assume !false; 5606#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5577#L128 assume { :end_inline_do_write_p } true; 5563#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5537#L266 assume eval_~tmp___0~1 != 0;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 5538#L139 assume ~c_dr_pc~0 == 0; 5556#L172-1 assume true; 5688#L150 assume !false; 5607#L151 assume !(~q_free~0 == 1); 5608#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := ~c_num_read~0 + 1;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5757#L32-3 assume ~p_dw_pc~0 == 1; 5754#L33-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 5753#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5751#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 5752#L74-3 assume immediate_notify_threads_~tmp~0 != 0;~p_dw_st~0 := 0; 5561#L74-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5524#L51-3 assume !(~c_dr_pc~0 == 1); 5525#L51-5 is_do_read_c_triggered_~__retres1~1 := 0; 5528#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5529#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 5571#L82-3 assume !(immediate_notify_threads_~tmp___0~0 != 0); 5597#L82-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 5592#L172 assume ~p_last_write~0 == ~c_last_read~0; 5593#L173 assume ~p_num_write~0 == ~c_num_read~0; 5581#L172-1 assume true; 5582#L150 assume !false; 5684#L151 assume ~q_free~0 == 1;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 5683#L186 assume { :end_inline_do_read_c } true; 5682#L262 assume true; 5681#L237-1 assume !false; 5680#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5657#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 5655#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5653#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5651#L242 assume eval_~tmp___1~0 != 0; 5649#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5611#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 5604#L96 assume !(~p_dw_pc~0 == 0); 5594#L99 assume ~p_dw_pc~0 == 1; 5595#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5623#L32 assume ~p_dw_pc~0 == 1; 5588#L33 assume !(~q_read_ev~0 == 1); 5589#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 5628#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5627#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 5626#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 5625#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5624#L51 assume !(~c_dr_pc~0 == 1); 5526#L51-2 [2018-11-10 00:55:06,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1571429197, now seen corresponding path program 4 times [2018-11-10 00:55:06,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 216347278, now seen corresponding path program 1 times [2018-11-10 00:55:06,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 00:55:06,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:06,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 00:55:06,147 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:06,148 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. cyclomatic complexity: 45 Second operand 3 states. [2018-11-10 00:55:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:06,174 INFO L93 Difference]: Finished difference Result 258 states and 295 transitions. [2018-11-10 00:55:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:06,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 295 transitions. [2018-11-10 00:55:06,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 214 [2018-11-10 00:55:06,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 295 transitions. [2018-11-10 00:55:06,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-10 00:55:06,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-10 00:55:06,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 295 transitions. [2018-11-10 00:55:06,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:06,177 INFO L705 BuchiCegarLoop]: Abstraction has 258 states and 295 transitions. [2018-11-10 00:55:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 295 transitions. [2018-11-10 00:55:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-11-10 00:55:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 00:55:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 261 transitions. [2018-11-10 00:55:06,180 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 261 transitions. [2018-11-10 00:55:06,180 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 261 transitions. [2018-11-10 00:55:06,180 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 00:55:06,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 261 transitions. [2018-11-10 00:55:06,181 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2018-11-10 00:55:06,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:06,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:06,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,182 INFO L793 eck$LassoCheckResult]: Stem: 6098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 6056#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 6057#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 6137#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 6136#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 6052#L201-1 assume { :end_inline_init_threads } true; 6053#L313-3 assume true; 6252#L313-1 assume !false; 6251#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6250#L262 assume true; 6249#L237-1 assume !false; 6248#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6247#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 6246#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6245#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6087#L242 assume eval_~tmp___1~0 != 0; 6083#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6084#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 6123#L96 assume ~p_dw_pc~0 == 0; 6124#L107-2 assume true; 6151#L107 assume !false; 6146#L108 assume !(~q_free~0 == 0); 6074#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6062#L32 assume !(~p_dw_pc~0 == 1); 6063#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6064#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6065#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6112#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 6088#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6054#L51 assume !(~c_dr_pc~0 == 1); 6048#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6049#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6055#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6122#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 6121#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 6093#L107-2 assume true; 6094#L107 assume !false; 6125#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6156#L128 assume { :end_inline_do_write_p } true; 6153#L247 [2018-11-10 00:55:06,182 INFO L795 eck$LassoCheckResult]: Loop: 6153#L247 assume !(~c_dr_st~0 == 0); 6149#L262 assume true; 6259#L237-1 assume !false; 6258#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6257#L214 assume !(~p_dw_st~0 == 0); 6255#L218 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 6256#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6175#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6176#L242 assume eval_~tmp___1~0 != 0; 6157#L242-1 assume !(~p_dw_st~0 == 0); 6153#L247 [2018-11-10 00:55:06,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1267338517, now seen corresponding path program 1 times [2018-11-10 00:55:06,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash 270683839, now seen corresponding path program 1 times [2018-11-10 00:55:06,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:55:06,252 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:55:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:55:06,252 INFO L87 Difference]: Start difference. First operand 230 states and 261 transitions. cyclomatic complexity: 35 Second operand 5 states. [2018-11-10 00:55:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:06,305 INFO L93 Difference]: Finished difference Result 254 states and 285 transitions. [2018-11-10 00:55:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 00:55:06,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 285 transitions. [2018-11-10 00:55:06,306 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-11-10 00:55:06,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 285 transitions. [2018-11-10 00:55:06,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-10 00:55:06,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-10 00:55:06,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 285 transitions. [2018-11-10 00:55:06,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:06,307 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-11-10 00:55:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 285 transitions. [2018-11-10 00:55:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 230. [2018-11-10 00:55:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 00:55:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2018-11-10 00:55:06,310 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-11-10 00:55:06,310 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-11-10 00:55:06,310 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 00:55:06,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 259 transitions. [2018-11-10 00:55:06,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2018-11-10 00:55:06,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:06,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:06,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,311 INFO L793 eck$LassoCheckResult]: Stem: 6596#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 6556#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 6557#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 6649#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 6648#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 6551#L201-1 assume { :end_inline_init_threads } true; 6552#L313-3 assume true; 6753#L313-1 assume !false; 6752#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6637#L262 assume true; 6570#L237-1 assume !false; 6571#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6644#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 6572#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6573#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6586#L242 assume eval_~tmp___1~0 != 0; 6583#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6584#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 6624#L96 assume ~p_dw_pc~0 == 0; 6625#L107-2 assume true; 6675#L107 assume !false; 6645#L108 assume !(~q_free~0 == 0); 6574#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6562#L32 assume !(~p_dw_pc~0 == 1); 6563#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6564#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6565#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6612#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 6587#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6553#L51 assume !(~c_dr_pc~0 == 1); 6554#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6689#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6686#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6684#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 6682#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 6680#L107-2 assume true; 6678#L107 assume !false; 6667#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6668#L128 assume { :end_inline_do_write_p } true; 6672#L247 [2018-11-10 00:55:06,311 INFO L795 eck$LassoCheckResult]: Loop: 6672#L247 assume !(~c_dr_st~0 == 0); 6671#L262 assume true; 6743#L237-1 assume !false; 6618#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6619#L214 assume !(~p_dw_st~0 == 0); 6631#L218 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 6632#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6694#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6693#L242 assume eval_~tmp___1~0 != 0; 6676#L242-1 assume !(~p_dw_st~0 == 0); 6672#L247 [2018-11-10 00:55:06,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1267338517, now seen corresponding path program 2 times [2018-11-10 00:55:06,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 268836797, now seen corresponding path program 1 times [2018-11-10 00:55:06,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:06,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:55:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:55:06,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:55:06,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 00:55:06,335 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:55:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:55:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:55:06,336 INFO L87 Difference]: Start difference. First operand 230 states and 259 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-10 00:55:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:55:06,356 INFO L93 Difference]: Finished difference Result 298 states and 335 transitions. [2018-11-10 00:55:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:55:06,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 335 transitions. [2018-11-10 00:55:06,358 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 243 [2018-11-10 00:55:06,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 298 states and 335 transitions. [2018-11-10 00:55:06,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2018-11-10 00:55:06,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2018-11-10 00:55:06,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 335 transitions. [2018-11-10 00:55:06,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:55:06,374 INFO L705 BuchiCegarLoop]: Abstraction has 298 states and 335 transitions. [2018-11-10 00:55:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 335 transitions. [2018-11-10 00:55:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 226. [2018-11-10 00:55:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 00:55:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2018-11-10 00:55:06,377 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 252 transitions. [2018-11-10 00:55:06,377 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 252 transitions. [2018-11-10 00:55:06,377 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 00:55:06,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 252 transitions. [2018-11-10 00:55:06,378 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 171 [2018-11-10 00:55:06,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:55:06,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:55:06,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:55:06,379 INFO L793 eck$LassoCheckResult]: Stem: 7132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 7091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~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; 7092#L346 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_init_threads } true; 7173#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 7172#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 7085#L201-1 assume { :end_inline_init_threads } true; 7086#L313-3 assume true; 7234#L313-1 assume !false; 7231#L314 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 7229#L262 assume true; 7227#L237-1 assume !false; 7224#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7222#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 7221#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7220#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 7219#L242 assume eval_~tmp___1~0 != 0; 7120#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 7121#L251 assume eval_~tmp~1 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 7157#L96 assume ~p_dw_pc~0 == 0; 7158#L107-2 assume true; 7195#L107 assume !false; 7191#L108 assume !(~q_free~0 == 0); 7110#L109 ~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 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7098#L32 assume !(~p_dw_pc~0 == 1); 7099#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 7100#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 7101#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 7145#L74 assume !(immediate_notify_threads_~tmp~0 != 0); 7125#L74-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7087#L51 assume !(~c_dr_pc~0 == 1); 7088#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 7217#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7215#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 7213#L82 assume !(immediate_notify_threads_~tmp___0~0 != 0); 7210#L82-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 7208#L107-2 assume true; 7206#L107 assume !false; 7202#L108 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 7199#L128 assume { :end_inline_do_write_p } true; 7196#L247 [2018-11-10 00:55:06,379 INFO L795 eck$LassoCheckResult]: Loop: 7196#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 7192#L266 assume !(eval_~tmp___0~1 != 0); 7193#L262 assume true; 7218#L237-1 assume !false; 7216#L238 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7214#L214 assume !(~p_dw_st~0 == 0); 7211#L218 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 7209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7207#L227 eval_#t~ret3 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 7203#L242 assume eval_~tmp___1~0 != 0; 7200#L242-1 assume !(~p_dw_st~0 == 0); 7196#L247 [2018-11-10 00:55:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1267338517, now seen corresponding path program 3 times [2018-11-10 00:55:06,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -558899936, now seen corresponding path program 1 times [2018-11-10 00:55:06,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:55:06,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:55:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2016189324, now seen corresponding path program 1 times [2018-11-10 00:55:06,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:55:06,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:55:06,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:55:06,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:55:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:55:06,619 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-11-10 00:55:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:55:06 BoogieIcfgContainer [2018-11-10 00:55:06,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:55:06,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:55:06,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:55:06,671 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:55:06,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:03" (3/4) ... [2018-11-10 00:55:06,674 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 00:55:06,722 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f7af57ee-bbde-4cc0-9019-978f4d199898/bin-2019/uautomizer/witness.graphml [2018-11-10 00:55:06,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:55:06,723 INFO L168 Benchmark]: Toolchain (without parser) took 3561.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,723 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:55:06,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.40 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:55:06,724 INFO L168 Benchmark]: Boogie Preprocessor took 50.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,724 INFO L168 Benchmark]: RCFGBuilder took 262.26 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,724 INFO L168 Benchmark]: BuchiAutomizer took 2985.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,725 INFO L168 Benchmark]: Witness Printer took 50.79 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: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:55:06,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 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 22.40 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.26 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2985.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Witness Printer took 50.79 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: 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 17 terminating modules (16 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * q_free + 1 and consists of 4 locations. 16 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 226 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 16. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 662 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 258 states and ocurred in iteration 13. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1981 SDtfs, 1779 SDslu, 2013 SDs, 0 SdLazy, 218 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT1 SILN0 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: 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=3, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55f8a906=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37a9881f=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d5516d4=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53dc4bb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51ddeedd=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76a03d10=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47defa72=0, tmp=0, c_last_read=0, __retres1=0, p_num_write=1, q_buf_0=3, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L354] CALL init_model() [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] RET c_dr_i = 1 [L354] init_model() [L355] CALL start_simulation() [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L310] CALL init_threads() [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] RET c_dr_st = 0 [L310] init_threads() [L313] COND TRUE 1 [L316] kernel_st = 1 [L317] CALL eval() [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L237] COND TRUE 1 [L240] CALL, EXPR exists_runnable_thread() [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] RET return (__retres1); [L240] EXPR exists_runnable_thread() [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp) [L253] p_dw_st = 1 [L254] CALL do_write_p() [L96] COND TRUE (int )p_dw_pc == 0 [L107] COND TRUE 1 [L109] COND FALSE !((int )q_free == 0) [L119] q_buf_0 = __VERIFIER_nondet_int() [L120] p_last_write = q_buf_0 [L121] p_num_write += 1 [L122] q_free = 0 [L123] q_write_ev = 1 [L124] CALL immediate_notify_threads() [L67] int tmp ; [L68] int tmp___0 ; [L72] CALL, EXPR is_do_write_p_triggered() [L29] int __retres1 ; [L32] COND FALSE !((int )p_dw_pc == 1) [L42] __retres1 = 0 [L44] RET return (__retres1); [L72] EXPR is_do_write_p_triggered() [L72] tmp = is_do_write_p_triggered() [L74] COND FALSE !(\read(tmp)) [L80] CALL, EXPR is_do_read_c_triggered() [L48] int __retres1 ; [L51] COND FALSE !((int )c_dr_pc == 1) [L61] __retres1 = 0 [L63] RET return (__retres1); [L80] EXPR is_do_read_c_triggered() [L80] tmp___0 = is_do_read_c_triggered() [L82] COND FALSE, RET !(\read(tmp___0)) [L124] immediate_notify_threads() [L125] q_write_ev = 2 [L107] COND TRUE 1 [L109] COND TRUE (int )q_free == 0 [L110] p_dw_st = 2 [L111] RET p_dw_pc = 1 [L254] do_write_p() Loop: [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) [L237] COND TRUE 1 [L240] CALL, EXPR exists_runnable_thread() [L211] int __retres1 ; [L214] COND FALSE !((int )p_dw_st == 0) [L218] COND TRUE (int )c_dr_st == 0 [L219] __retres1 = 1 [L227] RET return (__retres1); [L240] EXPR exists_runnable_thread() [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...