./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:51:44,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:51:44,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:51:44,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:51:44,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:51:44,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:51:44,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:51:44,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:51:44,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:51:44,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:51:44,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:51:44,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:51:44,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:51:44,507 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:51:44,508 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:51:44,508 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:51:44,508 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:51:44,508 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:51:44,509 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:51:44,509 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:51:44,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:51:44,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:51:44,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:51:44,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:51:44,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:51:44,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:51:44,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:51:44,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:51:44,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:51:44,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:51:44,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:51:44,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:51:44,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:51:44,514 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:51:44,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:51:44,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:51:44,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:51:44,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:51:44,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:51:44,516 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:51:44,517 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2024-11-17 08:51:44,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:51:44,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:51:44,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:51:44,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:51:44,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:51:44,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-17 08:51:46,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:51:46,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:51:46,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-17 08:51:46,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0d9760/bebb7239219646b1968c062789f5b378/FLAG27bcb38b1 [2024-11-17 08:51:46,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0d9760/bebb7239219646b1968c062789f5b378 [2024-11-17 08:51:46,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:51:46,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:51:46,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:46,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:51:46,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:51:46,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58637ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46, skipping insertion in model container [2024-11-17 08:51:46,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:51:46,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:46,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:51:46,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:46,834 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:51:46,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46 WrapperNode [2024-11-17 08:51:46,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:46,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:46,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:51:46,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:51:46,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,873 INFO L138 Inliner]: procedures = 24, calls = 23, calls flagged for inlining = 18, calls inlined = 21, statements flattened = 255 [2024-11-17 08:51:46,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:46,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:51:46,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:51:46,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:51:46,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:51:46,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:51:46,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:51:46,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:51:46,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:51:46,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (1/1) ... [2024-11-17 08:51:46,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:46,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:46,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:51:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:51:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:51:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:51:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:51:47,109 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:51:47,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:51:47,430 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-17 08:51:47,431 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:51:47,446 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:51:47,447 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:51:47,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:47 BoogieIcfgContainer [2024-11-17 08:51:47,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:51:47,449 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:51:47,450 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:51:47,454 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:51:47,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:47,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:51:46" (1/3) ... [2024-11-17 08:51:47,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@411b497e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:47, skipping insertion in model container [2024-11-17 08:51:47,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:47,458 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:46" (2/3) ... [2024-11-17 08:51:47,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@411b497e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:47, skipping insertion in model container [2024-11-17 08:51:47,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:47,459 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:47" (3/3) ... [2024-11-17 08:51:47,460 INFO L332 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-17 08:51:47,515 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:51:47,515 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:51:47,515 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:51:47,515 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:51:47,515 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:51:47,515 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:51:47,516 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:51:47,516 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:51:47,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:47,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2024-11-17 08:51:47,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:47,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:47,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,545 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:51:47,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:47,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2024-11-17 08:51:47,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:47,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:47,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,560 INFO L745 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 38#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 27#L356true assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 48#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 52#L211true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 28#L217true assume true;assume { :end_inline_init_threads } true; 6#L323true [2024-11-17 08:51:47,561 INFO L747 eck$LassoCheckResult]: Loop: 6#L323true assume true; 35#L323-1true assume !false; 59#start_simulation_while_3_continue#1true assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 57#L247true assume !true; 22#L255true assume true; 16#L291true assume true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 17#L224true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 13#L230true assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 50#L237true assume true;stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 18#L302true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 42#L304true assume true;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 9#L310true assume true;start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 72#L330true assume !(0 != start_simulation_~tmp~3#1); 6#L323true [2024-11-17 08:51:47,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1768624252, now seen corresponding path program 1 times [2024-11-17 08:51:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598248624] [2024-11-17 08:51:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598248624] [2024-11-17 08:51:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598248624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:47,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:47,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:51:47,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270757461] [2024-11-17 08:51:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:47,797 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:51:47,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash 480726034, now seen corresponding path program 1 times [2024-11-17 08:51:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:47,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531940481] [2024-11-17 08:51:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:47,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531940481] [2024-11-17 08:51:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531940481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:51:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102845214] [2024-11-17 08:51:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:47,825 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:47,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:51:47,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:51:47,859 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:47,881 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2024-11-17 08:51:47,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2024-11-17 08:51:47,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-17 08:51:47,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 83 states and 112 transitions. [2024-11-17 08:51:47,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-17 08:51:47,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-17 08:51:47,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 112 transitions. [2024-11-17 08:51:47,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:47,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-17 08:51:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 112 transitions. [2024-11-17 08:51:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-17 08:51:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 82 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-11-17 08:51:47,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-17 08:51:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:51:47,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-17 08:51:47,929 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:51:47,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 112 transitions. [2024-11-17 08:51:47,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-17 08:51:47,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:47,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:47,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:47,931 INFO L745 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 249#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 230#L356 assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 231#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 255#L211 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 232#L217 assume true;assume { :end_inline_init_threads } true; 205#L323 [2024-11-17 08:51:47,932 INFO L747 eck$LassoCheckResult]: Loop: 205#L323 assume true; 206#L323-1 assume !false; 244#start_simulation_while_3_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 201#L247 assume true; 260#L247-1 assume !false; 242#eval_while_2_continue#1 assume true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 243#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 271#L230-1 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 212#L237-1 assume true;eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 213#L252 assume !(0 != eval_~tmp___1~0#1); 226#L255 assume true; 218#L291 assume true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 219#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 214#L230 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 215#L237 assume true;stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 221#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 222#L304 assume true;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 209#L310 assume true;start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 210#L330 assume !(0 != start_simulation_~tmp~3#1); 205#L323 [2024-11-17 08:51:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1768623291, now seen corresponding path program 1 times [2024-11-17 08:51:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131506564] [2024-11-17 08:51:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131506564] [2024-11-17 08:51:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131506564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:47,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:51:47,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468364496] [2024-11-17 08:51:47,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:47,993 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:51:47,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash -531767207, now seen corresponding path program 1 times [2024-11-17 08:51:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437841078] [2024-11-17 08:51:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437841078] [2024-11-17 08:51:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437841078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:51:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978224001] [2024-11-17 08:51:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:48,089 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:51:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:51:48,090 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:48,110 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2024-11-17 08:51:48,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 111 transitions. [2024-11-17 08:51:48,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-17 08:51:48,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 111 transitions. [2024-11-17 08:51:48,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-17 08:51:48,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-17 08:51:48,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 111 transitions. [2024-11-17 08:51:48,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:48,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 111 transitions. [2024-11-17 08:51:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 111 transitions. [2024-11-17 08:51:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-17 08:51:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 82 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2024-11-17 08:51:48,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 111 transitions. [2024-11-17 08:51:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:51:48,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2024-11-17 08:51:48,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:51:48,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2024-11-17 08:51:48,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-17 08:51:48,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:48,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:48,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,140 INFO L745 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 424#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 405#L356 assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 406#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 429#L211 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 407#L217 assume true;assume { :end_inline_init_threads } true; 377#L323 [2024-11-17 08:51:48,142 INFO L747 eck$LassoCheckResult]: Loop: 377#L323 assume true; 378#L323-1 assume !false; 419#start_simulation_while_3_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 376#L247 assume true; 435#L247-1 assume !false; 415#eval_while_2_continue#1 assume true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 416#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 446#L230-1 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 387#L237-1 assume true;eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 388#L252 assume !(0 != eval_~tmp___1~0#1); 401#L255 assume true; 393#L291 assume true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 394#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 389#L230 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 390#L237 assume true;stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 396#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 397#L304 assume true;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 384#L310 assume true;start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 385#L330 assume !(0 != start_simulation_~tmp~3#1); 377#L323 [2024-11-17 08:51:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1768623260, now seen corresponding path program 1 times [2024-11-17 08:51:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839248339] [2024-11-17 08:51:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -531767207, now seen corresponding path program 2 times [2024-11-17 08:51:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033255523] [2024-11-17 08:51:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033255523] [2024-11-17 08:51:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033255523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:51:48,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592318354] [2024-11-17 08:51:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:48,311 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:51:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:51:48,313 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:48,373 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2024-11-17 08:51:48,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 116 transitions. [2024-11-17 08:51:48,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2024-11-17 08:51:48,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 88 states and 116 transitions. [2024-11-17 08:51:48,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-11-17 08:51:48,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2024-11-17 08:51:48,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 116 transitions. [2024-11-17 08:51:48,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:48,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-11-17 08:51:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 116 transitions. [2024-11-17 08:51:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-17 08:51:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 85 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2024-11-17 08:51:48,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 114 transitions. [2024-11-17 08:51:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:51:48,388 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 114 transitions. [2024-11-17 08:51:48,388 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:51:48,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 114 transitions. [2024-11-17 08:51:48,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2024-11-17 08:51:48,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:48,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:48,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,390 INFO L745 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 603#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 584#L356 assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 585#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 609#L211 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 586#L217 assume true;assume { :end_inline_init_threads } true; 559#L323 [2024-11-17 08:51:48,390 INFO L747 eck$LassoCheckResult]: Loop: 559#L323 assume true; 560#L323-1 assume !false; 598#start_simulation_while_3_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 555#L247 assume true; 614#L247-1 assume !false; 596#eval_while_2_continue#1 assume true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 597#L224-1 assume !(0 == ~p_dw_st~0); 626#L228-1 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 630#L230-1 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 634#L237-1 assume true;eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 633#L252 assume !(0 != eval_~tmp___1~0#1); 580#L255 assume true; 572#L291 assume true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 573#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 568#L230 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 569#L237 assume true;stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 576#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 577#L304 assume true;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 561#L310 assume true;start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 562#L330 assume !(0 != start_simulation_~tmp~3#1); 559#L323 [2024-11-17 08:51:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1768623260, now seen corresponding path program 2 times [2024-11-17 08:51:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414323237] [2024-11-17 08:51:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1067758276, now seen corresponding path program 1 times [2024-11-17 08:51:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668910019] [2024-11-17 08:51:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668910019] [2024-11-17 08:51:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668910019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:51:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579449044] [2024-11-17 08:51:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:48,463 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:48,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:51:48,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:51:48,464 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:48,504 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-17 08:51:48,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 190 transitions. [2024-11-17 08:51:48,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 136 [2024-11-17 08:51:48,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 145 states and 190 transitions. [2024-11-17 08:51:48,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2024-11-17 08:51:48,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2024-11-17 08:51:48,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 190 transitions. [2024-11-17 08:51:48,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:48,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 190 transitions. [2024-11-17 08:51:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 190 transitions. [2024-11-17 08:51:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2024-11-17 08:51:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 125 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2024-11-17 08:51:48,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 164 transitions. [2024-11-17 08:51:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:51:48,524 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2024-11-17 08:51:48,524 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:51:48,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 164 transitions. [2024-11-17 08:51:48,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2024-11-17 08:51:48,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:48,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:48,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,526 INFO L745 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 841#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 821#L356 assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 822#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 849#L211 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 823#L217 assume true;assume { :end_inline_init_threads } true; 824#L323 assume true; 896#L323-1 assume !false; 885#start_simulation_while_3_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 884#L247 [2024-11-17 08:51:48,526 INFO L747 eck$LassoCheckResult]: Loop: 884#L247 assume true; 883#L247-1 assume !false; 882#eval_while_2_continue#1 assume true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 881#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 880#L230-1 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 879#L237-1 assume true;eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 878#L252 assume 0 != eval_~tmp___1~0#1; 876#L257 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 873#L261 assume !(0 != eval_~tmp~1#1); 874#L272 assume !(0 == ~c_dr_st~0); 884#L247 [2024-11-17 08:51:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1603085850, now seen corresponding path program 1 times [2024-11-17 08:51:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869170970] [2024-11-17 08:51:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash 536042181, now seen corresponding path program 1 times [2024-11-17 08:51:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584728225] [2024-11-17 08:51:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1711200874, now seen corresponding path program 1 times [2024-11-17 08:51:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937520526] [2024-11-17 08:51:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937520526] [2024-11-17 08:51:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937520526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:51:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826829344] [2024-11-17 08:51:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:51:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:51:48,727 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:48,769 INFO L93 Difference]: Finished difference Result 219 states and 284 transitions. [2024-11-17 08:51:48,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 284 transitions. [2024-11-17 08:51:48,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 210 [2024-11-17 08:51:48,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 284 transitions. [2024-11-17 08:51:48,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2024-11-17 08:51:48,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2024-11-17 08:51:48,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 284 transitions. [2024-11-17 08:51:48,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:48,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-11-17 08:51:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 284 transitions. [2024-11-17 08:51:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 177. [2024-11-17 08:51:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 176 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2024-11-17 08:51:48,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 228 transitions. [2024-11-17 08:51:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:51:48,793 INFO L425 stractBuchiCegarLoop]: Abstraction has 177 states and 228 transitions. [2024-11-17 08:51:48,793 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:51:48,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 228 transitions. [2024-11-17 08:51:48,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 168 [2024-11-17 08:51:48,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:48,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:48,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:48,795 INFO L745 eck$LassoCheckResult]: Stem: 1231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~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; 1196#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;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; 1175#L356 assume true;assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1176#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1207#L211 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1177#L217 assume true;assume { :end_inline_init_threads } true; 1178#L323 assume true; 1288#L323-1 assume !false; 1284#start_simulation_while_3_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1283#L247 [2024-11-17 08:51:48,796 INFO L747 eck$LassoCheckResult]: Loop: 1283#L247 assume true; 1282#L247-1 assume !false; 1281#eval_while_2_continue#1 assume true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1280#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1279#L230-1 assume true;exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1278#L237-1 assume true;eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1277#L252 assume 0 != eval_~tmp___1~0#1; 1276#L257 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1243#L261 assume !(0 != eval_~tmp~1#1); 1244#L272 assume 0 == ~c_dr_st~0;havoc eval_#t~nondet9#1;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 1285#L276 assume !(0 != eval_~tmp___0~1#1); 1283#L247 [2024-11-17 08:51:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1603085850, now seen corresponding path program 2 times [2024-11-17 08:51:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464400231] [2024-11-17 08:51:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash -562561515, now seen corresponding path program 1 times [2024-11-17 08:51:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212218906] [2024-11-17 08:51:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1507619600, now seen corresponding path program 1 times [2024-11-17 08:51:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:48,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313182386] [2024-11-17 08:51:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:48,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:49,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:49,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:51:49 BoogieIcfgContainer [2024-11-17 08:51:49,414 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:51:49,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:51:49,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:51:49,415 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:51:49,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:47" (3/4) ... [2024-11-17 08:51:49,419 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:51:49,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:51:49,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:51:49,467 INFO L158 Benchmark]: Toolchain (without parser) took 2936.09ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 96.8MB in the beginning and 182.5MB in the end (delta: -85.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:51:49,468 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:51:49,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:51:49,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.58ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:51:49,468 INFO L158 Benchmark]: Boogie Preprocessor took 55.04ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:51:49,469 INFO L158 Benchmark]: IcfgBuilder took 517.57ms. Allocated memory is still 155.2MB. Free memory was 77.9MB in the beginning and 59.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 08:51:49,469 INFO L158 Benchmark]: BuchiAutomizer took 1964.68ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 59.6MB in the beginning and 185.7MB in the end (delta: -126.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:51:49,470 INFO L158 Benchmark]: Witness Printer took 52.55ms. Allocated memory is still 237.0MB. Free memory was 185.7MB in the beginning and 182.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 08:51:49,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.58ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.04ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 517.57ms. Allocated memory is still 155.2MB. Free memory was 77.9MB in the beginning and 59.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 1964.68ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 59.6MB in the beginning and 185.7MB in the end (delta: -126.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 52.55ms. Allocated memory is still 237.0MB. Free memory was 185.7MB in the beginning and 182.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 177 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 1084 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 475 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 609 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown 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 InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 247]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 247]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:51:49,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)