./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/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 aa63abe8d244d72d8b78f82e911235dbe511cfc8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:28:23,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:28:23,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:28:23,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:28:23,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:28:23,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:28:23,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:28:23,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:28:23,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:28:23,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:28:23,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:28:23,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:28:23,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:28:23,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:28:23,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:28:23,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:28:23,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:28:23,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:28:23,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:28:23,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:28:23,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:28:23,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:28:23,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:28:23,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:28:23,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:28:23,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:28:23,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:28:23,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:28:23,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:28:23,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:28:23,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:28:23,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:28:23,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:28:23,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:28:23,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:28:23,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:28:23,697 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:28:23,708 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:28:23,708 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:28:23,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:28:23,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:28:23,709 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:28:23,709 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:28:23,709 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:28:23,709 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:28:23,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:28:23,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:28:23,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:28:23,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:28:23,712 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:28:23,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:28:23,712 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:28:23,712 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:28:23,712 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:28:23,712 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_7ce289e3-5840-4a38-8a18-83beb962c072/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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-11-10 05:28:23,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:28:23,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:28:23,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:28:23,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:28:23,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:28:23,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 05:28:23,781 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/data/50b018954/950bd956be784e4b932373e188f0766a/FLAG35de5419c [2018-11-10 05:28:24,182 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:28:24,183 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 05:28:24,187 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/data/50b018954/950bd956be784e4b932373e188f0766a/FLAG35de5419c [2018-11-10 05:28:24,199 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/data/50b018954/950bd956be784e4b932373e188f0766a [2018-11-10 05:28:24,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:28:24,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:28:24,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:28:24,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:28:24,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:28:24,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edf5c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24, skipping insertion in model container [2018-11-10 05:28:24,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:28:24,240 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:28:24,379 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:28:24,383 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:28:24,405 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:28:24,415 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:28:24,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24 WrapperNode [2018-11-10 05:28:24,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:28:24,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:28:24,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:28:24,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:28:24,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:28:24,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:28:24,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:28:24,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:28:24,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... [2018-11-10 05:28:24,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:28:24,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:28:24,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:28:24,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:28:24,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/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 05:28:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:28:24,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:28:24,763 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:28:24,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:28:24 BoogieIcfgContainer [2018-11-10 05:28:24,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:28:24,764 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:28:24,764 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:28:24,767 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:28:24,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:28:24,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:28:24" (1/3) ... [2018-11-10 05:28:24,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658f3f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:28:24, skipping insertion in model container [2018-11-10 05:28:24,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:28:24,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:24" (2/3) ... [2018-11-10 05:28:24,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658f3f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:28:24, skipping insertion in model container [2018-11-10 05:28:24,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:28:24,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:28:24" (3/3) ... [2018-11-10 05:28:24,771 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-10 05:28:24,815 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:28:24,815 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:28:24,815 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:28:24,816 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:28:24,816 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:28:24,816 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:28:24,816 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:28:24,816 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:28:24,816 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:28:24,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2018-11-10 05:28:24,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-10 05:28:24,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:24,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:24,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:28:24,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:24,856 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:28:24,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2018-11-10 05:28:24,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-10 05:28:24,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:24,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:24,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:28:24,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:24,867 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; 83#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; 85#L196true assume !(~p_dw_i~0 == 1);~p_dw_st~0 := 2; 82#L196-2true assume !(~c_dr_i~0 == 1);~c_dr_st~0 := 2; 7#L201-1true assume { :end_inline_init_threads } true; 72#L313-3true [2018-11-10 05:28:24,868 INFO L795 eck$LassoCheckResult]: Loop: 72#L313-3true assume true; 68#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; 71#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; 77#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; 74#L320true assume !(start_simulation_~tmp~3 != 0); 72#L313-3true [2018-11-10 05:28:24,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2018-11-10 05:28:24,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:24,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:24,961 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 05:28:24,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:24,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:24,965 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:28:24,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash -630922042, now seen corresponding path program 1 times [2018-11-10 05:28:24,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:24,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:24,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:24,971 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 05:28:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:28:24,973 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:28:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:24,984 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2018-11-10 05:28:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:24,998 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2018-11-10 05:28:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:25,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 110 transitions. [2018-11-10 05:28:25,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 05:28:25,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 75 states and 104 transitions. [2018-11-10 05:28:25,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 05:28:25,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 05:28:25,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 104 transitions. [2018-11-10 05:28:25,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:28:25,009 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-11-10 05:28:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 104 transitions. [2018-11-10 05:28:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 05:28:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 05:28:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2018-11-10 05:28:25,031 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-11-10 05:28:25,031 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-11-10 05:28:25,031 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:28:25,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 104 transitions. [2018-11-10 05:28:25,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 05:28:25,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:25,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:25,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,035 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 05:28:25,035 INFO L793 eck$LassoCheckResult]: Stem: 227#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; 187#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; 188#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; 247#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 246#L196-2 assume !(~c_dr_i~0 == 1);~c_dr_st~0 := 2; 182#L201-1 assume { :end_inline_init_threads } true; 183#L313-3 [2018-11-10 05:28:25,035 INFO L795 eck$LassoCheckResult]: Loop: 183#L313-3 assume true; 243#L313-1 assume !false; 210#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; 174#L262 assume true; 202#L237-1 assume !false; 203#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; 236#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 204#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 205#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; 218#L242 assume !(eval_~tmp___1~0 != 0); 219#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; 230#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 200#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 201#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; 211#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 196#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 197#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; 231#L320 assume !(start_simulation_~tmp~3 != 0); 183#L313-3 [2018-11-10 05:28:25,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2018-11-10 05:28:25,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:25,055 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 05:28:25,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:25,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:25,056 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:28:25,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 982456073, now seen corresponding path program 1 times [2018-11-10 05:28:25,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:25,108 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 05:28:25,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:25,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:28:25,108 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:28:25,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:25,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:25,109 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-10 05:28:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:25,116 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-10 05:28:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:25,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-11-10 05:28:25,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 05:28:25,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 103 transitions. [2018-11-10 05:28:25,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 05:28:25,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 05:28:25,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 103 transitions. [2018-11-10 05:28:25,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:28:25,120 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 05:28:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 103 transitions. [2018-11-10 05:28:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 05:28:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 05:28:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2018-11-10 05:28:25,124 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 05:28:25,124 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-11-10 05:28:25,124 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:28:25,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 103 transitions. [2018-11-10 05:28:25,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 05:28:25,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:25,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:25,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,126 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 05:28:25,126 INFO L793 eck$LassoCheckResult]: Stem: 383#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; 346#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; 347#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; 406#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 405#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 341#L201-1 assume { :end_inline_init_threads } true; 342#L313-3 [2018-11-10 05:28:25,126 INFO L795 eck$LassoCheckResult]: Loop: 342#L313-3 assume true; 402#L313-1 assume !false; 369#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; 333#L262 assume true; 361#L237-1 assume !false; 362#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; 395#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 363#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 364#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; 377#L242 assume !(eval_~tmp___1~0 != 0); 378#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; 388#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 359#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 360#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; 370#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 355#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 356#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; 390#L320 assume !(start_simulation_~tmp~3 != 0); 342#L313-3 [2018-11-10 05:28:25,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2018-11-10 05:28:25,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash 982456073, now seen corresponding path program 2 times [2018-11-10 05:28:25,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:25,189 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 05:28:25,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:25,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:28:25,190 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:28:25,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:28:25,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:28:25,190 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-11-10 05:28:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:25,253 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2018-11-10 05:28:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:28:25,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 201 transitions. [2018-11-10 05:28:25,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2018-11-10 05:28:25,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 201 transitions. [2018-11-10 05:28:25,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-11-10 05:28:25,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-11-10 05:28:25,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 201 transitions. [2018-11-10 05:28:25,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:28:25,257 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 201 transitions. [2018-11-10 05:28:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 201 transitions. [2018-11-10 05:28:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2018-11-10 05:28:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 05:28:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2018-11-10 05:28:25,260 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 106 transitions. [2018-11-10 05:28:25,260 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 106 transitions. [2018-11-10 05:28:25,261 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:28:25,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 106 transitions. [2018-11-10 05:28:25,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2018-11-10 05:28:25,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:25,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:25,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,262 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 05:28:25,262 INFO L793 eck$LassoCheckResult]: Stem: 623#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; 585#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; 586#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; 646#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 645#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 580#L201-1 assume { :end_inline_init_threads } true; 581#L313-3 [2018-11-10 05:28:25,262 INFO L795 eck$LassoCheckResult]: Loop: 581#L313-3 assume true; 642#L313-1 assume !false; 608#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; 572#L262 assume true; 600#L237-1 assume !false; 601#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; 634#L214 assume !(~p_dw_st~0 == 0); 640#L218 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 641#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 648#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; 647#L242 assume !(eval_~tmp___1~0 != 0); 626#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; 627#L214-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 598#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 599#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; 609#L292 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 594#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 595#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; 629#L320 assume !(start_simulation_~tmp~3 != 0); 581#L313-3 [2018-11-10 05:28:25,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2018-11-10 05:28:25,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:28:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2122569385, now seen corresponding path program 1 times [2018-11-10 05:28:25,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:28:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:25,290 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 05:28:25,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:25,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:25,291 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:28:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:25,291 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-10 05:28:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:25,318 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-10 05:28:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:25,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 178 transitions. [2018-11-10 05:28:25,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-11-10 05:28:25,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 178 transitions. [2018-11-10 05:28:25,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-10 05:28:25,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-10 05:28:25,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 178 transitions. [2018-11-10 05:28:25,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:28:25,323 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 178 transitions. [2018-11-10 05:28:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 178 transitions. [2018-11-10 05:28:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2018-11-10 05:28:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 05:28:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2018-11-10 05:28:25,328 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-11-10 05:28:25,328 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-11-10 05:28:25,328 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:28:25,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 153 transitions. [2018-11-10 05:28:25,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-10 05:28:25,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:25,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:25,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,330 INFO L793 eck$LassoCheckResult]: Stem: 838#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; 802#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; 803#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; 869#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 868#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 797#L201-1 assume { :end_inline_init_threads } true; 798#L313-3 assume true; 885#L313-1 assume !false; 883#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; 879#L262 [2018-11-10 05:28:25,331 INFO L795 eck$LassoCheckResult]: Loop: 879#L262 assume true; 878#L237-1 assume !false; 877#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; 876#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 875#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 874#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; 873#L242 assume eval_~tmp___1~0 != 0; 872#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 862#L251 assume !(eval_~tmp~1 != 0); 863#L247 assume !(~c_dr_st~0 == 0); 879#L262 [2018-11-10 05:28:25,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 1 times [2018-11-10 05:28:25,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash -401111289, now seen corresponding path program 1 times [2018-11-10 05:28:25,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1826038419, now seen corresponding path program 1 times [2018-11-10 05:28:25,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:25,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:25,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:28:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:25,406 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. cyclomatic complexity: 39 Second operand 3 states. [2018-11-10 05:28:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:25,447 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2018-11-10 05:28:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:25,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 267 transitions. [2018-11-10 05:28:25,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-11-10 05:28:25,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 202 states and 267 transitions. [2018-11-10 05:28:25,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2018-11-10 05:28:25,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2018-11-10 05:28:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 267 transitions. [2018-11-10 05:28:25,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:28:25,451 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 267 transitions. [2018-11-10 05:28:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 267 transitions. [2018-11-10 05:28:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2018-11-10 05:28:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 05:28:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2018-11-10 05:28:25,457 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-11-10 05:28:25,457 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-11-10 05:28:25,457 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:28:25,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 213 transitions. [2018-11-10 05:28:25,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 153 [2018-11-10 05:28:25,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:28:25,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:28:25,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:25,459 INFO L793 eck$LassoCheckResult]: Stem: 1168#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; 1127#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; 1128#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; 1203#L196 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 1201#L196-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 1122#L201-1 assume { :end_inline_init_threads } true; 1123#L313-3 assume true; 1189#L313-1 assume !false; 1151#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; 1133#L262 [2018-11-10 05:28:25,459 INFO L795 eck$LassoCheckResult]: Loop: 1133#L262 assume true; 1143#L237-1 assume !false; 1144#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; 1180#L214 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 1250#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1249#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; 1159#L242 assume eval_~tmp___1~0 != 0; 1160#L242-1 assume ~p_dw_st~0 == 0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1190#L251 assume !(eval_~tmp~1 != 0); 1191#L247 assume ~c_dr_st~0 == 0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 1131#L266 assume !(eval_~tmp___0~1 != 0); 1133#L262 [2018-11-10 05:28:25,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 2 times [2018-11-10 05:28:25,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 450448784, now seen corresponding path program 1 times [2018-11-10 05:28:25,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:28:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash 772612996, now seen corresponding path program 1 times [2018-11-10 05:28:25,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:28:25,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:28:25,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:25,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:28:25,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:28:25 BoogieIcfgContainer [2018-11-10 05:28:25,635 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:28:25,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:28:25,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:28:25,636 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:28:25,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:28:24" (3/4) ... [2018-11-10 05:28:25,638 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 05:28:25,675 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ce289e3-5840-4a38-8a18-83beb962c072/bin-2019/uautomizer/witness.graphml [2018-11-10 05:28:25,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:28:25,676 INFO L168 Benchmark]: Toolchain (without parser) took 1474.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 959.2 MB in the beginning and 996.1 MB in the end (delta: -36.9 MB). Peak memory consumption was 120.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,677 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:28:25,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 944.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.56 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,678 INFO L168 Benchmark]: Boogie Preprocessor took 51.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,678 INFO L168 Benchmark]: RCFGBuilder took 271.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,679 INFO L168 Benchmark]: BuchiAutomizer took 871.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 128.0 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,679 INFO L168 Benchmark]: Witness Printer took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 999.4 MB in the beginning and 996.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:28:25,681 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 944.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.56 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 942.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 871.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 128.0 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. * Witness Printer took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 999.4 MB in the beginning and 996.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 162 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 128 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 162 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 577 SDtfs, 613 SDslu, 455 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 237]: 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=0, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a31812d=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, p_dw_pc=0, tmp=0, q_free=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7af0b14b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bbc0a79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bdc0335=0, p_dw_st=0, c_last_read=0, p_num_write=0, q_buf_0=0, __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 ; Loop: [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 FALSE !(\read(tmp)) [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...