./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:53:24,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:53:24,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:53:24,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:53:24,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:53:24,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:53:24,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:53:24,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:53:24,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:53:24,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:53:24,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:53:24,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:53:24,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:53:24,203 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:53:24,206 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:53:24,206 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:53:24,207 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:53:24,207 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:53:24,207 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:53:24,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:53:24,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:53:24,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:53:24,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:53:24,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:53:24,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:53:24,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:53:24,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:53:24,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:53:24,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:53:24,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:53:24,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:53:24,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:53:24,212 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:53:24,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:53:24,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:53:24,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:53:24,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:53:24,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:53:24,213 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:53:24,214 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-23 02:53:24,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:53:24,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:53:24,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:53:24,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:53:24,564 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:53:24,565 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-23 02:53:26,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:53:26,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:53:26,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-23 02:53:26,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2c30ba4/afa8986a1a554df3b1dbde68277bf7b2/FLAG3e3d8507a [2024-11-23 02:53:26,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2c30ba4/afa8986a1a554df3b1dbde68277bf7b2 [2024-11-23 02:53:26,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:53:26,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:53:26,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:53:26,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:53:26,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:53:26,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:26,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597f6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26, skipping insertion in model container [2024-11-23 02:53:26,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:26,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:53:26,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:53:26,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:53:26,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:53:26,956 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:53:26,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26 WrapperNode [2024-11-23 02:53:26,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:53:26,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:53:26,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:53:26,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:53:26,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:26,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,005 INFO L138 Inliner]: procedures = 24, calls = 23, calls flagged for inlining = 18, calls inlined = 21, statements flattened = 259 [2024-11-23 02:53:27,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:53:27,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:53:27,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:53:27,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:53:27,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,050 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-23 02:53:27,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:53:27,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:53:27,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:53:27,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:53:27,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (1/1) ... [2024-11-23 02:53:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:53:27,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:27,125 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-23 02:53:27,133 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-23 02:53:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:53:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:53:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:53:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:53:27,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:53:27,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:53:27,537 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-23 02:53:27,537 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:53:27,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:53:27,553 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-23 02:53:27,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:27 BoogieIcfgContainer [2024-11-23 02:53:27,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:53:27,554 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:53:27,554 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:53:27,558 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:53:27,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:27,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:53:26" (1/3) ... [2024-11-23 02:53:27,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec66531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:27, skipping insertion in model container [2024-11-23 02:53:27,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:27,562 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:26" (2/3) ... [2024-11-23 02:53:27,563 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec66531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:27, skipping insertion in model container [2024-11-23 02:53:27,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:27,563 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:27" (3/3) ... [2024-11-23 02:53:27,565 INFO L332 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-23 02:53:27,619 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:53:27,619 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:53:27,620 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:53:27,620 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:53:27,620 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:53:27,620 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:53:27,620 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:53:27,620 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:53:27,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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-23 02:53:27,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2024-11-23 02:53:27,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:27,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:27,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:53:27,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:27,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:53:27,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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-23 02:53:27,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2024-11-23 02:53:27,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:27,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:27,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:53:27,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:27,670 INFO L745 eck$LassoCheckResult]: Stem: 31#$Ultimate##0true 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; 43#L-1true 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; 68#init_model_returnLabel#1true 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; 37#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 3#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 44#L211-1true assume { :end_inline_init_threads } true; 66#L323-2true [2024-11-23 02:53:27,672 INFO L747 eck$LassoCheckResult]: Loop: 66#L323-2true assume !false; 12#L324true 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; 48#L272true assume false; 15#eval_returnLabel#1true 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; 59#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 77#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 28#exists_runnable_thread_returnLabel#2true 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; 13#L302true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 14#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 74#stop_simulation_returnLabel#1true 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; 55#L330true assume !(0 != start_simulation_~tmp~3#1); 66#L323-2true [2024-11-23 02:53:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2024-11-23 02:53:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422686186] [2024-11-23 02:53:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:27,909 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-23 02:53:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422686186] [2024-11-23 02:53:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422686186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:27,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:27,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:53:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468333024] [2024-11-23 02:53:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:27,917 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:53:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1504754769, now seen corresponding path program 1 times [2024-11-23 02:53:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954963318] [2024-11-23 02:53:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:27,943 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-23 02:53:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954963318] [2024-11-23 02:53:27,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954963318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:27,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:27,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:53:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231218842] [2024-11-23 02:53:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:27,946 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:53:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:53:28,002 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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-23 02:53:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:28,030 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-11-23 02:53:28,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 106 transitions. [2024-11-23 02:53:28,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-23 02:53:28,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 100 transitions. [2024-11-23 02:53:28,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-23 02:53:28,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-11-23 02:53:28,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 100 transitions. [2024-11-23 02:53:28,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:28,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-23 02:53:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 100 transitions. [2024-11-23 02:53:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 02:53:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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-23 02:53:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-11-23 02:53:28,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-23 02:53:28,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:53:28,092 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-23 02:53:28,092 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:53:28,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 100 transitions. [2024-11-23 02:53:28,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-23 02:53:28,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:28,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:28,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,097 INFO L745 eck$LassoCheckResult]: Stem: 211#$Ultimate##0 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; 212#L-1 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; 222#init_model_returnLabel#1 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; 217#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 171#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 172#L211-1 assume { :end_inline_init_threads } true; 223#L323-2 [2024-11-23 02:53:28,098 INFO L747 eck$LassoCheckResult]: Loop: 223#L323-2 assume !false; 188#L324 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; 174#L272 assume !false; 227#L248 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; 179#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 180#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 182#exists_runnable_thread_returnLabel#1 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; 183#L252 assume !(0 != eval_~tmp___1~0#1); 192#eval_returnLabel#1 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; 193#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 232#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 208#exists_runnable_thread_returnLabel#2 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; 189#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 190#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 191#stop_simulation_returnLabel#1 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; 229#L330 assume !(0 != start_simulation_~tmp~3#1); 223#L323-2 [2024-11-23 02:53:28,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2024-11-23 02:53:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458833170] [2024-11-23 02:53:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:28,164 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-23 02:53:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458833170] [2024-11-23 02:53:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458833170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:28,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:28,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:53:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65689113] [2024-11-23 02:53:28,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:28,167 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:53:28,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 1 times [2024-11-23 02:53:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776256006] [2024-11-23 02:53:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:28,257 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-23 02:53:28,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:28,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776256006] [2024-11-23 02:53:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776256006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:53:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762201514] [2024-11-23 02:53:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:28,261 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:28,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:53:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:53:28,263 INFO L87 Difference]: Start difference. First operand 71 states and 100 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-23 02:53:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:28,275 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-11-23 02:53:28,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 99 transitions. [2024-11-23 02:53:28,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-23 02:53:28,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 99 transitions. [2024-11-23 02:53:28,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-23 02:53:28,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-11-23 02:53:28,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2024-11-23 02:53:28,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:28,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-23 02:53:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2024-11-23 02:53:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-23 02:53:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 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-23 02:53:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-23 02:53:28,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-23 02:53:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:53:28,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-23 02:53:28,285 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:53:28,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2024-11-23 02:53:28,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-23 02:53:28,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:28,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:28,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,287 INFO L745 eck$LassoCheckResult]: Stem: 363#$Ultimate##0 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; 364#L-1 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; 373#init_model_returnLabel#1 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; 370#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 322#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 323#L211-1 assume { :end_inline_init_threads } true; 374#L323-2 [2024-11-23 02:53:28,287 INFO L747 eck$LassoCheckResult]: Loop: 374#L323-2 assume !false; 341#L324 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; 325#L272 assume !false; 378#L248 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; 330#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 331#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 333#exists_runnable_thread_returnLabel#1 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; 334#L252 assume !(0 != eval_~tmp___1~0#1); 343#eval_returnLabel#1 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; 344#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 383#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 357#exists_runnable_thread_returnLabel#2 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; 339#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 340#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 342#stop_simulation_returnLabel#1 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; 381#L330 assume !(0 != start_simulation_~tmp~3#1); 374#L323-2 [2024-11-23 02:53:28,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2024-11-23 02:53:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794328638] [2024-11-23 02:53:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 2 times [2024-11-23 02:53:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409903664] [2024-11-23 02:53:28,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,356 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:28,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:28,419 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-23 02:53:28,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409903664] [2024-11-23 02:53:28,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409903664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:28,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:53:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182264342] [2024-11-23 02:53:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:28,421 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:28,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:53:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:53:28,422 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-23 02:53:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:28,472 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-11-23 02:53:28,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 104 transitions. [2024-11-23 02:53:28,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2024-11-23 02:53:28,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 104 transitions. [2024-11-23 02:53:28,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-23 02:53:28,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-23 02:53:28,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 104 transitions. [2024-11-23 02:53:28,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:28,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-23 02:53:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 104 transitions. [2024-11-23 02:53:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-23 02:53:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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-23 02:53:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-23 02:53:28,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-23 02:53:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:53:28,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-23 02:53:28,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:53:28,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2024-11-23 02:53:28,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2024-11-23 02:53:28,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:28,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:28,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,490 INFO L745 eck$LassoCheckResult]: Stem: 518#$Ultimate##0 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; 519#L-1 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; 529#init_model_returnLabel#1 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; 524#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 473#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 474#L211-1 assume { :end_inline_init_threads } true; 530#L323-2 [2024-11-23 02:53:28,491 INFO L747 eck$LassoCheckResult]: Loop: 530#L323-2 assume !false; 494#L324 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; 480#L272 assume !false; 533#L248 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; 485#L224 assume !(0 == ~p_dw_st~0); 487#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 500#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 546#exists_runnable_thread_returnLabel#1 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; 545#L252 assume !(0 != eval_~tmp___1~0#1); 498#eval_returnLabel#1 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; 499#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 539#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 513#exists_runnable_thread_returnLabel#2 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; 495#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 496#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 497#stop_simulation_returnLabel#1 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; 537#L330 assume !(0 != start_simulation_~tmp~3#1); 530#L323-2 [2024-11-23 02:53:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2024-11-23 02:53:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536675688] [2024-11-23 02:53:28,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:28,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:28,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 960183933, now seen corresponding path program 1 times [2024-11-23 02:53:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899618818] [2024-11-23 02:53:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:28,554 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-23 02:53:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:28,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899618818] [2024-11-23 02:53:28,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899618818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:28,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:28,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:53:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509764753] [2024-11-23 02:53:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:28,556 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:28,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:53:28,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:53:28,557 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-23 02:53:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:28,600 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2024-11-23 02:53:28,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 170 transitions. [2024-11-23 02:53:28,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2024-11-23 02:53:28,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 170 transitions. [2024-11-23 02:53:28,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-11-23 02:53:28,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-11-23 02:53:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2024-11-23 02:53:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:28,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 170 transitions. [2024-11-23 02:53:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2024-11-23 02:53:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2024-11-23 02:53:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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-23 02:53:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2024-11-23 02:53:28,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2024-11-23 02:53:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:53:28,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2024-11-23 02:53:28,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:53:28,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2024-11-23 02:53:28,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-11-23 02:53:28,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:28,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:28,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,625 INFO L745 eck$LassoCheckResult]: Stem: 724#$Ultimate##0 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; 725#L-1 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; 736#init_model_returnLabel#1 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; 731#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 678#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 679#L211-1 assume { :end_inline_init_threads } true; 737#L323-2 assume !false; 767#L324 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; 763#L272 [2024-11-23 02:53:28,625 INFO L747 eck$LassoCheckResult]: Loop: 763#L272 assume !false; 762#L248 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; 761#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 760#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 759#exists_runnable_thread_returnLabel#1 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; 747#L252 assume 0 != eval_~tmp___1~0#1; 748#L252-1 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 755#L261 assume !(0 != eval_~tmp~1#1); 756#L257 assume !(0 == ~c_dr_st~0); 763#L272 [2024-11-23 02:53:28,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2024-11-23 02:53:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677445082] [2024-11-23 02:53:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1880932392, now seen corresponding path program 1 times [2024-11-23 02:53:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299189318] [2024-11-23 02:53:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118884, now seen corresponding path program 1 times [2024-11-23 02:53:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696984465] [2024-11-23 02:53:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:28,727 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-23 02:53:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696984465] [2024-11-23 02:53:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696984465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:53:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784525337] [2024-11-23 02:53:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:53:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:53:28,799 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-23 02:53:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:28,835 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2024-11-23 02:53:28,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 254 transitions. [2024-11-23 02:53:28,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 181 [2024-11-23 02:53:28,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 254 transitions. [2024-11-23 02:53:28,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2024-11-23 02:53:28,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2024-11-23 02:53:28,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 254 transitions. [2024-11-23 02:53:28,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:28,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 254 transitions. [2024-11-23 02:53:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 254 transitions. [2024-11-23 02:53:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 151. [2024-11-23 02:53:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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-23 02:53:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2024-11-23 02:53:28,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 202 transitions. [2024-11-23 02:53:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:53:28,864 INFO L425 stractBuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2024-11-23 02:53:28,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:53:28,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2024-11-23 02:53:28,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2024-11-23 02:53:28,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:28,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:28,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:28,867 INFO L745 eck$LassoCheckResult]: Stem: 1033#$Ultimate##0 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; 1034#L-1 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; 1044#init_model_returnLabel#1 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; 1040#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 983#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 984#L211-1 assume { :end_inline_init_threads } true; 1045#L323-2 assume !false; 1103#L324 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; 1102#L272 [2024-11-23 02:53:28,867 INFO L747 eck$LassoCheckResult]: Loop: 1102#L272 assume !false; 1101#L248 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; 1095#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1093#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1094#exists_runnable_thread_returnLabel#1 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; 1089#L252 assume 0 != eval_~tmp___1~0#1; 1090#L252-1 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1076#L261 assume !(0 != eval_~tmp~1#1); 1067#L257 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; 1068#L276 assume !(0 != eval_~tmp___0~1#1); 1102#L272 [2024-11-23 02:53:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2024-11-23 02:53:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090116602] [2024-11-23 02:53:28,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:28,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:28,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1820641230, now seen corresponding path program 1 times [2024-11-23 02:53:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077159624] [2024-11-23 02:53:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1408918910, now seen corresponding path program 1 times [2024-11-23 02:53:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000125339] [2024-11-23 02:53:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:28,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:29,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:29,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:53:29 BoogieIcfgContainer [2024-11-23 02:53:29,452 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:53:29,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:53:29,453 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:53:29,453 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:53:29,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:27" (3/4) ... [2024-11-23 02:53:29,456 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-23 02:53:29,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-23 02:53:29,524 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:53:29,524 INFO L158 Benchmark]: Toolchain (without parser) took 2910.12ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 130.9MB in the beginning and 97.7MB in the end (delta: 33.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,524 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 165.7MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:53:29,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.29ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 125.4MB in the end (delta: 5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.39ms. Allocated memory is still 165.7MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,525 INFO L158 Benchmark]: Boogie Preprocessor took 72.53ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 120.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,525 INFO L158 Benchmark]: RCFGBuilder took 471.57ms. Allocated memory is still 165.7MB. Free memory was 120.4MB in the beginning and 124.7MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,526 INFO L158 Benchmark]: BuchiAutomizer took 1898.17ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 124.7MB in the beginning and 100.8MB in the end (delta: 23.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,526 INFO L158 Benchmark]: Witness Printer took 71.10ms. Allocated memory is still 199.2MB. Free memory was 100.8MB in the beginning and 97.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 02:53:29,531 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.23ms. Allocated memory is still 165.7MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.29ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 125.4MB in the end (delta: 5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.39ms. Allocated memory is still 165.7MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.53ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 120.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.57ms. Allocated memory is still 165.7MB. Free memory was 120.4MB in the beginning and 124.7MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1898.17ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 124.7MB in the beginning and 100.8MB in the end (delta: 23.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 71.10ms. Allocated memory is still 199.2MB. Free memory was 100.8MB in the beginning and 97.7MB 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 151 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. 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, 57 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, 344 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 950 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 531 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-23 02:53:29,554 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)