./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_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/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_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/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-10-27 06:10:45,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:45,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:45,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:45,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:45,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:45,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:45,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:45,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:45,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:45,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:45,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:45,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:45,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:45,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:45,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:45,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:45,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:45,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:45,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:45,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:45,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:45,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:45,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:45,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:45,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:45,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:45,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:45,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:45,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:45,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:45,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:45,392 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:45,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:45,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:45,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:45,393 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:10:45,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:45,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:45,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:45,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:45,407 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:45,408 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:45,408 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:45,408 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:45,408 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:45,408 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:45,408 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:45,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:45,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:45,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:45,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:10:45,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:45,410 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:45,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:45,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:45,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:45,412 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:45,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:45,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:45,413 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:45,414 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:45,414 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_d224b58c-1f3e-4dbf-93e8-bda591431081/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-10-27 06:10:45,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:45,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:45,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:45,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:45,456 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:45,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-10-27 06:10:45,501 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/data/7c9a26013/9883c9d2089e4713aa1723f8e16fafff/FLAG4c0321733 [2018-10-27 06:10:45,902 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:45,911 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-10-27 06:10:45,918 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/data/7c9a26013/9883c9d2089e4713aa1723f8e16fafff/FLAG4c0321733 [2018-10-27 06:10:45,928 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/data/7c9a26013/9883c9d2089e4713aa1723f8e16fafff [2018-10-27 06:10:45,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:45,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:45,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:45,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:45,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:45,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:45" (1/1) ... [2018-10-27 06:10:45,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f25e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:45, skipping insertion in model container [2018-10-27 06:10:45,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:45" (1/1) ... [2018-10-27 06:10:45,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:45,980 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:46,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:46,118 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:46,148 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:46,158 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:46,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46 WrapperNode [2018-10-27 06:10:46,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:46,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:46,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:46,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:46,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:46,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:46,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:46,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:46,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... [2018-10-27 06:10:46,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:46,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:46,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:46,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:46,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/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-10-27 06:10:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:46,962 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:46,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:46 BoogieIcfgContainer [2018-10-27 06:10:46,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:46,963 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:46,963 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:46,967 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:46,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:46,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:45" (1/3) ... [2018-10-27 06:10:46,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a7625c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:46, skipping insertion in model container [2018-10-27 06:10:46,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:46,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:46" (2/3) ... [2018-10-27 06:10:46,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a7625c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:46, skipping insertion in model container [2018-10-27 06:10:46,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:46,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:46" (3/3) ... [2018-10-27 06:10:46,973 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-10-27 06:10:47,020 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:47,021 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:47,021 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:47,021 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:47,021 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:47,021 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:47,021 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:47,021 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:47,021 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:47,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2018-10-27 06:10:47,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-10-27 06:10:47,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,068 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:47,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2018-10-27 06:10:47,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-10-27 06:10:47,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,080 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-10-27 06:10:47,081 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-10-27 06:10:47,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2018-10-27 06:10:47,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:47,256 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:47,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -630922042, now seen corresponding path program 1 times [2018-10-27 06:10:47,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:47,265 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:47,280 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2018-10-27 06:10:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:47,322 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2018-10-27 06:10:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:47,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 110 transitions. [2018-10-27 06:10:47,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-10-27 06:10:47,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 75 states and 104 transitions. [2018-10-27 06:10:47,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-10-27 06:10:47,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-10-27 06:10:47,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 104 transitions. [2018-10-27 06:10:47,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:47,334 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-10-27 06:10:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 104 transitions. [2018-10-27 06:10:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-27 06:10:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 06:10:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2018-10-27 06:10:47,363 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-10-27 06:10:47,363 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2018-10-27 06:10:47,363 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:47,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 104 transitions. [2018-10-27 06:10:47,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-10-27 06:10:47,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,367 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-10-27 06:10:47,368 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-10-27 06:10:47,368 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-10-27 06:10:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2018-10-27 06:10:47,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:47,452 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:47,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 982456073, now seen corresponding path program 1 times [2018-10-27 06:10:47,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:47,562 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:47,562 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-10-27 06:10:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:47,591 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-10-27 06:10:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:47,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-10-27 06:10:47,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-10-27 06:10:47,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 103 transitions. [2018-10-27 06:10:47,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-10-27 06:10:47,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-10-27 06:10:47,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 103 transitions. [2018-10-27 06:10:47,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:47,596 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-10-27 06:10:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 103 transitions. [2018-10-27 06:10:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-27 06:10:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 06:10:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2018-10-27 06:10:47,600 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-10-27 06:10:47,600 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 103 transitions. [2018-10-27 06:10:47,600 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:47,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 103 transitions. [2018-10-27 06:10:47,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-10-27 06:10:47,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,601 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-10-27 06:10:47,602 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-10-27 06:10:47,602 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-10-27 06:10:47,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2018-10-27 06:10:47,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:47,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash 982456073, now seen corresponding path program 2 times [2018-10-27 06:10:47,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:47,719 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:47,719 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-10-27 06:10:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:48,012 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2018-10-27 06:10:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:48,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 201 transitions. [2018-10-27 06:10:48,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2018-10-27 06:10:48,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 201 transitions. [2018-10-27 06:10:48,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-10-27 06:10:48,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-10-27 06:10:48,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 201 transitions. [2018-10-27 06:10:48,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:48,023 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 201 transitions. [2018-10-27 06:10:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 201 transitions. [2018-10-27 06:10:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2018-10-27 06:10:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 06:10:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2018-10-27 06:10:48,036 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 106 transitions. [2018-10-27 06:10:48,036 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 106 transitions. [2018-10-27 06:10:48,036 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:48,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 106 transitions. [2018-10-27 06:10:48,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2018-10-27 06:10:48,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:48,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:48,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,037 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-10-27 06:10:48,038 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-10-27 06:10:48,038 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-10-27 06:10:48,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2018-10-27 06:10:48,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:48,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2122569385, now seen corresponding path program 1 times [2018-10-27 06:10:48,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:48,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:48,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:48,100 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:48,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:48,101 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-10-27 06:10:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:48,229 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-10-27 06:10:48,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:48,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 178 transitions. [2018-10-27 06:10:48,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-10-27 06:10:48,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 178 transitions. [2018-10-27 06:10:48,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-10-27 06:10:48,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-10-27 06:10:48,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 178 transitions. [2018-10-27 06:10:48,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:48,232 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 178 transitions. [2018-10-27 06:10:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 178 transitions. [2018-10-27 06:10:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2018-10-27 06:10:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-27 06:10:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2018-10-27 06:10:48,240 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-10-27 06:10:48,240 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-10-27 06:10:48,241 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:48,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 153 transitions. [2018-10-27 06:10:48,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-10-27 06:10:48,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:48,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:48,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,242 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-10-27 06:10:48,242 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-10-27 06:10:48,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 1 times [2018-10-27 06:10:48,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash -401111289, now seen corresponding path program 1 times [2018-10-27 06:10:48,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1826038419, now seen corresponding path program 1 times [2018-10-27 06:10:48,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:48,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:48,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:48,593 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-27 06:10:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:48,608 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. cyclomatic complexity: 39 Second operand 3 states. [2018-10-27 06:10:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:48,670 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2018-10-27 06:10:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:48,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 267 transitions. [2018-10-27 06:10:48,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-10-27 06:10:48,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 202 states and 267 transitions. [2018-10-27 06:10:48,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2018-10-27 06:10:48,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2018-10-27 06:10:48,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 267 transitions. [2018-10-27 06:10:48,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:48,676 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 267 transitions. [2018-10-27 06:10:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 267 transitions. [2018-10-27 06:10:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2018-10-27 06:10:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-27 06:10:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2018-10-27 06:10:48,689 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-10-27 06:10:48,689 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-10-27 06:10:48,689 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:48,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 213 transitions. [2018-10-27 06:10:48,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 153 [2018-10-27 06:10:48,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:48,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:48,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,691 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-10-27 06:10:48,692 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-10-27 06:10:48,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1537844595, now seen corresponding path program 2 times [2018-10-27 06:10:48,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash 450448784, now seen corresponding path program 1 times [2018-10-27 06:10:48,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash 772612996, now seen corresponding path program 1 times [2018-10-27 06:10:48,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,019 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-10-27 06:10:49,354 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:10:49,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:49 BoogieIcfgContainer [2018-10-27 06:10:49,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:49,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:49,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:49,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:49,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:46" (3/4) ... [2018-10-27 06:10:49,422 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:10:49,470 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d224b58c-1f3e-4dbf-93e8-bda591431081/bin-2019/uautomizer/witness.graphml [2018-10-27 06:10:49,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:49,471 INFO L168 Benchmark]: Toolchain (without parser) took 3539.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 960.7 MB in the beginning and 1.0 GB in the end (delta: -48.7 MB). Peak memory consumption was 106.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,472 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:49,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.17 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,473 INFO L168 Benchmark]: Boogie Preprocessor took 22.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:49,473 INFO L168 Benchmark]: RCFGBuilder took 748.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,474 INFO L168 Benchmark]: BuchiAutomizer took 2454.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,474 INFO L168 Benchmark]: Witness Printer took 52.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:49,478 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.17 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 748.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2454.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * Witness Printer took 52.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 2.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. 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.3s 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@6a414c5=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@5deb2e01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@491d9b7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@337a6905=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...