./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix053.opt.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix053.opt.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 11:03:03,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 11:03:03,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 11:03:03,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 11:03:03,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 11:03:03,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 11:03:03,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 11:03:03,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 11:03:03,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 11:03:03,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 11:03:03,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 11:03:03,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 11:03:03,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 11:03:03,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 11:03:03,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 11:03:03,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 11:03:03,525 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 11:03:03,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 11:03:03,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 11:03:03,526 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 11:03:03,526 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 11:03:03,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-03-19 11:03:03,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 11:03:03,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 11:03:03,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 11:03:03,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 11:03:03,792 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 11:03:03,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-03-19 11:03:05,047 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cdf8301b1/23d92cdb13fd49f8ba8ab66ef83164ad/FLAGbb5c5e843 [2025-03-19 11:03:05,261 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 11:03:05,262 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053.opt.i [2025-03-19 11:03:05,275 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cdf8301b1/23d92cdb13fd49f8ba8ab66ef83164ad/FLAGbb5c5e843 [2025-03-19 11:03:06,051 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cdf8301b1/23d92cdb13fd49f8ba8ab66ef83164ad [2025-03-19 11:03:06,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 11:03:06,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 11:03:06,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 11:03:06,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 11:03:06,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 11:03:06,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efd3271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06, skipping insertion in model container [2025-03-19 11:03:06,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 11:03:06,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053.opt.i[944,957] [2025-03-19 11:03:06,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 11:03:06,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 11:03:06,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053.opt.i[944,957] [2025-03-19 11:03:06,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 11:03:06,417 INFO L204 MainTranslator]: Completed translation [2025-03-19 11:03:06,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06 WrapperNode [2025-03-19 11:03:06,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 11:03:06,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 11:03:06,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 11:03:06,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 11:03:06,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,463 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2025-03-19 11:03:06,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 11:03:06,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 11:03:06,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 11:03:06,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 11:03:06,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 11:03:06,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 11:03:06,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 11:03:06,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 11:03:06,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (1/1) ... [2025-03-19 11:03:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 11:03:06,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 11:03:06,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 11:03:06,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 11:03:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-19 11:03:06,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-19 11:03:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-19 11:03:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-19 11:03:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-19 11:03:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 11:03:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-19 11:03:06,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 11:03:06,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 11:03:06,539 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 11:03:06,625 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 11:03:06,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 11:03:06,829 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 11:03:06,829 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 11:03:06,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 11:03:06,984 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 11:03:06,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:03:06 BoogieIcfgContainer [2025-03-19 11:03:06,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 11:03:06,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 11:03:06,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 11:03:06,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 11:03:06,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 11:03:06" (1/3) ... [2025-03-19 11:03:06,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598d7183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:03:06, skipping insertion in model container [2025-03-19 11:03:06,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:03:06" (2/3) ... [2025-03-19 11:03:06,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598d7183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:03:06, skipping insertion in model container [2025-03-19 11:03:06,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:03:06" (3/3) ... [2025-03-19 11:03:06,992 INFO L128 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2025-03-19 11:03:07,002 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 11:03:07,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix053.opt.i that has 5 procedures, 48 locations, 44 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-19 11:03:07,004 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 11:03:07,047 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-19 11:03:07,079 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 11:03:07,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 11:03:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 11:03:07,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-19 11:03:07,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-19 11:03:07,148 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 11:03:07,157 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 11:03:07,162 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65b72d8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 11:03:07,163 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-19 11:03:13,427 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-19 11:03:13,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 11:03:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1196258151, now seen corresponding path program 1 times [2025-03-19 11:03:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 11:03:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419503907] [2025-03-19 11:03:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 11:03:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 11:03:13,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-19 11:03:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-19 11:03:13,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 11:03:13,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 11:03:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 11:03:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 11:03:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419503907] [2025-03-19 11:03:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419503907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 11:03:14,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 11:03:14,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 11:03:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580372800] [2025-03-19 11:03:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 11:03:14,279 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-19 11:03:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 11:03:14,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-19 11:03:14,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-19 11:03:14,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:14,293 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 11:03:14,294 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-03-19 11:03:14,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:15,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:15,293 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 11:03:15,293 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-19 11:03:15,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 11:03:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 334819932, now seen corresponding path program 1 times [2025-03-19 11:03:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 11:03:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993695992] [2025-03-19 11:03:15,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 11:03:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 11:03:15,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-19 11:03:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-19 11:03:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 11:03:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 11:03:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 11:03:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 11:03:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993695992] [2025-03-19 11:03:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993695992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 11:03:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 11:03:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-19 11:03:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413670905] [2025-03-19 11:03:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 11:03:15,523 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 11:03:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 11:03:15,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 11:03:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-19 11:03:15,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:15,525 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 11:03:15,525 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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) [2025-03-19 11:03:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:15,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:15,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 11:03:15,625 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 11:03:15,625 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-19 11:03:15,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 11:03:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1368818162, now seen corresponding path program 1 times [2025-03-19 11:03:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 11:03:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154255161] [2025-03-19 11:03:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 11:03:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 11:03:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-19 11:03:15,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-19 11:03:15,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 11:03:15,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 11:03:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 11:03:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 11:03:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154255161] [2025-03-19 11:03:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154255161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 11:03:15,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 11:03:15,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-19 11:03:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806829751] [2025-03-19 11:03:15,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 11:03:15,811 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-19 11:03:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 11:03:15,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-19 11:03:15,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-19 11:03:15,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:15,812 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 11:03:15,812 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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) [2025-03-19 11:03:15,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:15,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 11:03:15,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:23,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:23,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 11:03:23,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 11:03:23,332 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 11:03:23,333 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-19 11:03:23,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 11:03:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -400436680, now seen corresponding path program 2 times [2025-03-19 11:03:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 11:03:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617091563] [2025-03-19 11:03:23,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 11:03:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 11:03:23,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-03-19 11:03:23,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-19 11:03:23,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 11:03:23,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 11:03:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 11:03:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 11:03:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617091563] [2025-03-19 11:03:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617091563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 11:03:23,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 11:03:23,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-19 11:03:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503348862] [2025-03-19 11:03:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 11:03:23,744 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 11:03:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 11:03:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 11:03:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-19 11:03:23,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:23,745 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 11:03:23,745 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2025-03-19 11:03:23,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:23,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 11:03:23,745 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 11:03:23,746 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 11:03:24,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 11:03:24,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 11:03:24,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 11:03:24,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 11:03:24,203 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-19 11:03:24,203 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-19 11:03:24,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 11:03:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1188022760, now seen corresponding path program 3 times [2025-03-19 11:03:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 11:03:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071059816] [2025-03-19 11:03:24,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 11:03:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 11:03:24,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-03-19 11:03:24,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-19 11:03:24,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-19 11:03:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 11:03:24,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 11:03:24,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-19 11:03:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-19 11:03:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 11:03:24,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 11:03:24,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 11:03:24,290 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 11:03:24,292 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-19 11:03:24,293 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-03-19 11:03:24,294 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-19 11:03:24,294 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-19 11:03:24,294 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-19 11:03:24,294 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-19 11:03:24,298 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-19 11:03:24,299 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2025-03-19 11:03:24,401 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-19 11:03:24,401 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 11:03:24,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-03-19 11:03:24,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 11:03:24 BasicIcfg [2025-03-19 11:03:24,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 11:03:24,415 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 11:03:24,415 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 11:03:24,415 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 11:03:24,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:03:06" (3/4) ... [2025-03-19 11:03:24,416 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-19 11:03:24,512 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-19 11:03:24,547 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-03-19 11:03:24,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-03-19 11:03:24,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 11:03:24,549 INFO L158 Benchmark]: Toolchain (without parser) took 18494.53ms. Allocated memory was 83.9MB in the beginning and 729.8MB in the end (delta: 645.9MB). Free memory was 58.1MB in the beginning and 575.5MB in the end (delta: -517.4MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,549 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 11:03:24,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.31ms. Allocated memory is still 83.9MB. Free memory was 57.8MB in the beginning and 32.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 83.9MB. Free memory was 32.1MB in the beginning and 29.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 11:03:24,551 INFO L158 Benchmark]: Boogie Preprocessor took 25.50ms. Allocated memory is still 83.9MB. Free memory was 29.8MB in the beginning and 28.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,551 INFO L158 Benchmark]: RCFGBuilder took 493.49ms. Allocated memory is still 83.9MB. Free memory was 28.3MB in the beginning and 51.7MB in the end (delta: -23.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,551 INFO L158 Benchmark]: TraceAbstraction took 17427.78ms. Allocated memory was 83.9MB in the beginning and 729.8MB in the end (delta: 645.9MB). Free memory was 51.1MB in the beginning and 599.7MB in the end (delta: -548.6MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,552 INFO L158 Benchmark]: Witness Printer took 133.73ms. Allocated memory is still 729.8MB. Free memory was 599.7MB in the beginning and 575.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-19 11:03:24,553 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.96ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.31ms. Allocated memory is still 83.9MB. Free memory was 57.8MB in the beginning and 32.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 83.9MB. Free memory was 32.1MB in the beginning and 29.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.50ms. Allocated memory is still 83.9MB. Free memory was 29.8MB in the beginning and 28.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 493.49ms. Allocated memory is still 83.9MB. Free memory was 28.3MB in the beginning and 51.7MB in the end (delta: -23.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17427.78ms. Allocated memory was 83.9MB in the beginning and 729.8MB in the end (delta: 645.9MB). Free memory was 51.1MB in the beginning and 599.7MB in the end (delta: -548.6MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 133.73ms. Allocated memory is still 729.8MB. Free memory was 599.7MB in the beginning and 575.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 73346, independent: 69947, independent conditional: 68830, independent unconditional: 1117, dependent: 3399, dependent conditional: 3369, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73253, independent: 69947, independent conditional: 0, independent unconditional: 69947, dependent: 3306, dependent conditional: 0, dependent unconditional: 3306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1148, independent: 1117, independent conditional: 0, independent unconditional: 1117, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1148, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 46, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13829, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 13716, dependent conditional: 0, dependent unconditional: 13716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 73253, independent: 68830, independent conditional: 0, independent unconditional: 68830, dependent: 3275, dependent conditional: 0, dependent unconditional: 3275, unknown: 1148, unknown conditional: 0, unknown unconditional: 1148] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1117, Positive conditional cache size: 0, Positive unconditional cache size: 1117, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93, Persistent sets #1 benchmarks: Persistent set computation time: 13.1s, Number of persistent set computation: 3818, Number of trivial persistent sets: 1834, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 73346, independent: 69947, independent conditional: 68830, independent unconditional: 1117, dependent: 3399, dependent conditional: 3369, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73253, independent: 69947, independent conditional: 0, independent unconditional: 69947, dependent: 3306, dependent conditional: 0, dependent unconditional: 3306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1148, independent: 1117, independent conditional: 0, independent unconditional: 1117, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1148, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 46, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13829, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 13716, dependent conditional: 0, dependent unconditional: 13716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 73253, independent: 68830, independent conditional: 0, independent unconditional: 68830, dependent: 3275, dependent conditional: 0, dependent unconditional: 3275, unknown: 1148, unknown conditional: 0, unknown unconditional: 1148] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1117, Positive conditional cache size: 0, Positive unconditional cache size: 1117, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 return 0; [L778] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L801] 3 return 0; [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413=-2, t1414=-1, t1415=0, t1416=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 81 locations, 77 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 15.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-19 11:03:24,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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