./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 16:02:36,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 16:02:36,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 16:02:36,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 16:02:36,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 16:02:36,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 16:02:36,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 16:02:36,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 16:02:36,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 16:02:36,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 16:02:36,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 16:02:36,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 16:02:36,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 16:02:36,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 16:02:36,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 16:02:36,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 16:02:36,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 16:02:36,788 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 16:02:36,788 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-jdk21/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 -> ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 16:02:37,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 16:02:37,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 16:02:37,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 16:02:37,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 16:02:37,027 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 16:02:37,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2025-01-23 16:02:38,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/876f30882/0243db5f1dd549d79be1e66655bf9a37/FLAGa3d529f77 [2025-01-23 16:02:38,334 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 16:02:38,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2025-01-23 16:02:38,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/876f30882/0243db5f1dd549d79be1e66655bf9a37/FLAGa3d529f77 [2025-01-23 16:02:38,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/876f30882/0243db5f1dd549d79be1e66655bf9a37 [2025-01-23 16:02:38,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 16:02:38,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 16:02:38,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 16:02:38,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 16:02:38,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 16:02:38,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7234af8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38, skipping insertion in model container [2025-01-23 16:02:38,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 16:02:38,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2025-01-23 16:02:38,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 16:02:38,602 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 16:02:38,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2025-01-23 16:02:38,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 16:02:38,730 INFO L204 MainTranslator]: Completed translation [2025-01-23 16:02:38,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38 WrapperNode [2025-01-23 16:02:38,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 16:02:38,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 16:02:38,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 16:02:38,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 16:02:38,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,768 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2025-01-23 16:02:38,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 16:02:38,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 16:02:38,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 16:02:38,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 16:02:38,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 16:02:38,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 16:02:38,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 16:02:38,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 16:02:38,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (1/1) ... [2025-01-23 16:02:38,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 16:02:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 16:02:38,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 16:02:38,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 16:02:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-23 16:02:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-23 16:02:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-23 16:02:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-23 16:02:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 16:02:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 16:02:38,852 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 16:02:38,946 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 16:02:38,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 16:02:39,166 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 16:02:39,166 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 16:02:39,306 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 16:02:39,307 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 16:02:39,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 04:02:39 BoogieIcfgContainer [2025-01-23 16:02:39,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 16:02:39,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 16:02:39,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 16:02:39,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 16:02:39,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 04:02:38" (1/3) ... [2025-01-23 16:02:39,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ba342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 04:02:39, skipping insertion in model container [2025-01-23 16:02:39,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 04:02:38" (2/3) ... [2025-01-23 16:02:39,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ba342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 04:02:39, skipping insertion in model container [2025-01-23 16:02:39,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 04:02:39" (3/3) ... [2025-01-23 16:02:39,318 INFO L128 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2025-01-23 16:02:39,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 16:02:39,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-23 16:02:39,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 16:02:39,372 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 16:02:39,399 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:02:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 16:02:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 16:02:39,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 16:02:39,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 16:02:39,465 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 16:02:39,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 16:02:39,485 INFO L333 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;@7010f5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 16:02:39,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-23 16:02:47,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 16:02:47,956 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:02:47,956 INFO L139 ounterexampleChecker]: Examining path program with hash -646291418, occurence #1 [2025-01-23 16:02:47,956 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:02:47,956 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:02:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:02:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1270743866, now seen corresponding path program 1 times [2025-01-23 16:02:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:02:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249439581] [2025-01-23 16:02:47,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:02:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:02:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-23 16:02:48,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 16:02:48,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:02:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:02:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:02:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:02:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249439581] [2025-01-23 16:02:48,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249439581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:02:48,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:02:48,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:02:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581434957] [2025-01-23 16:02:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:02:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 16:02:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:02:48,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 16:02:48,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-23 16:02:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:02:48,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:02:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-01-23 16:02:48,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:02:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:02:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 16:02:49,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 16:02:49,912 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:02:49,912 INFO L139 ounterexampleChecker]: Examining path program with hash 1856864661, occurence #1 [2025-01-23 16:02:49,912 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:02:49,912 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:02:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:02:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -116194550, now seen corresponding path program 1 times [2025-01-23 16:02:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:02:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121811482] [2025-01-23 16:02:49,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 16:02:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:02:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 16:02:49,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 16:02:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:02:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:02:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:02:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:02:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121811482] [2025-01-23 16:02:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121811482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:02:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:02:50,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 16:02:50,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371134393] [2025-01-23 16:02:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:02:50,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 16:02:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:02:50,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 16:02:50,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-23 16:02:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:02:50,209 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:02:50,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-01-23 16:02:50,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:02:50,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:02:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:02:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:02:57,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 16:02:57,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 16:02:57,692 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:02:57,693 INFO L139 ounterexampleChecker]: Examining path program with hash 1344707087, occurence #1 [2025-01-23 16:02:57,693 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:02:57,693 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:02:57,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:02:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1365158066, now seen corresponding path program 2 times [2025-01-23 16:02:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:02:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218553014] [2025-01-23 16:02:57,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 16:02:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:02:57,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-01-23 16:02:57,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 16:02:57,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 16:02:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:02:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:02:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:02:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218553014] [2025-01-23 16:02:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218553014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:02:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:02:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 16:02:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000032012] [2025-01-23 16:02:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:02:57,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 16:02:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:02:57,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 16:02:57,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-23 16:02:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:02:57,970 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:02:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-01-23 16:02:57,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:02:57,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:02:57,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:03:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:03:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:03:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 16:03:04,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 16:03:04,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 16:03:04,647 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:03:04,647 INFO L139 ounterexampleChecker]: Examining path program with hash -400397788, occurence #1 [2025-01-23 16:03:04,647 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:03:04,647 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:03:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:03:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1081814234, now seen corresponding path program 3 times [2025-01-23 16:03:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:03:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969934632] [2025-01-23 16:03:04,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 16:03:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:03:04,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-01-23 16:03:04,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 16:03:04,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 16:03:04,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 16:03:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 16:03:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 16:03:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969934632] [2025-01-23 16:03:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969934632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 16:03:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 16:03:04,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 16:03:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300611131] [2025-01-23 16:03:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 16:03:04,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 16:03:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 16:03:04,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 16:03:04,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-23 16:03:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:03:04,890 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 16:03:04,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-01-23 16:03:04,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:03:04,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:03:04,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 16:03:04,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 16:03:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 16:03:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 16:03:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 16:03:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 16:03:05,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 16:03:05,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 16:03:05,167 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 16:03:05,168 INFO L139 ounterexampleChecker]: Examining path program with hash -1521600296, occurence #1 [2025-01-23 16:03:05,168 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 16:03:05,168 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 16:03:05,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 16:03:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 732953124, now seen corresponding path program 4 times [2025-01-23 16:03:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 16:03:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933285371] [2025-01-23 16:03:05,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 16:03:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 16:03:05,176 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-23 16:03:05,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 16:03:05,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 16:03:05,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:03:05,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 16:03:05,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 16:03:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 16:03:05,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 16:03:05,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 16:03:05,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 16:03:05,300 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 16:03:05,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-23 16:03:05,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-23 16:03:05,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-23 16:03:05,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-23 16:03:05,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 16:03:05,307 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-01-23 16:03:05,308 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2025-01-23 16:03:05,379 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-23 16:03:05,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 16:03:05,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-23 16:03:05,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 04:03:05 BasicIcfg [2025-01-23 16:03:05,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 16:03:05,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 16:03:05,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 16:03:05,397 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 16:03:05,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 04:02:39" (3/4) ... [2025-01-23 16:03:05,398 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-23 16:03:05,474 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-23 16:03:05,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-23 16:03:05,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-23 16:03:05,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 16:03:05,510 INFO L158 Benchmark]: Toolchain (without parser) took 27148.90ms. Allocated memory was 83.9MB in the beginning and 629.1MB in the end (delta: 545.3MB). Free memory was 57.9MB in the beginning and 543.9MB in the end (delta: -486.0MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-01-23 16:03:05,510 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 16:03:05,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.97ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 32.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-23 16:03:05,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.01ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 30.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 16:03:05,511 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 83.9MB. Free memory was 30.7MB in the beginning and 29.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 16:03:05,511 INFO L158 Benchmark]: RCFGBuilder took 499.31ms. Allocated memory is still 83.9MB. Free memory was 29.2MB in the beginning and 49.2MB in the end (delta: -20.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-01-23 16:03:05,512 INFO L158 Benchmark]: TraceAbstraction took 26086.68ms. Allocated memory was 83.9MB in the beginning and 629.1MB in the end (delta: 545.3MB). Free memory was 48.7MB in the beginning and 559.9MB in the end (delta: -511.2MB). Peak memory consumption was 380.7MB. Max. memory is 16.1GB. [2025-01-23 16:03:05,512 INFO L158 Benchmark]: Witness Printer took 112.64ms. Allocated memory is still 629.1MB. Free memory was 559.9MB in the beginning and 543.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-23 16:03:05,513 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.20ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.97ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 32.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.01ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 30.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 83.9MB. Free memory was 30.7MB in the beginning and 29.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 499.31ms. Allocated memory is still 83.9MB. Free memory was 29.2MB in the beginning and 49.2MB in the end (delta: -20.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26086.68ms. Allocated memory was 83.9MB in the beginning and 629.1MB in the end (delta: 545.3MB). Free memory was 48.7MB in the beginning and 559.9MB in the end (delta: -511.2MB). Peak memory consumption was 380.7MB. Max. memory is 16.1GB. * Witness Printer took 112.64ms. Allocated memory is still 629.1MB. Free memory was 559.9MB in the beginning and 543.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. 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: 16634, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 1204, dependent conditional: 1164, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16360, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 930, dependent conditional: 890, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16360, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 930, dependent conditional: 890, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 4830, dependent conditional: 4790, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 657, independent unconditional: 14773, dependent: 4830, dependent conditional: 66, dependent unconditional: 4764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 657, independent unconditional: 14773, dependent: 4830, dependent conditional: 66, dependent unconditional: 4764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 750, independent: 706, independent conditional: 10, independent unconditional: 696, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 750, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23228, independent: 149, independent conditional: 79, independent unconditional: 70, dependent: 23079, dependent conditional: 9, dependent unconditional: 23070, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 20260, independent: 14724, independent conditional: 647, independent unconditional: 14077, dependent: 4786, dependent conditional: 65, dependent unconditional: 4721, unknown: 750, unknown conditional: 11, unknown unconditional: 739] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 706, Positive conditional cache size: 10, Positive unconditional cache size: 696, Negative cache size: 44, Negative conditional cache size: 1, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18801, Maximal queried relation: 4, Independence queries for same thread: 274, Persistent sets #1 benchmarks: Persistent set computation time: 22.1s, Number of persistent set computation: 975, Number of trivial persistent sets: 623, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 736, independent: 696, independent conditional: 0, independent unconditional: 696, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16634, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 1204, dependent conditional: 1164, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16360, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 930, dependent conditional: 890, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16360, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 930, dependent conditional: 890, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 14734, independent unconditional: 696, dependent: 4830, dependent conditional: 4790, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 657, independent unconditional: 14773, dependent: 4830, dependent conditional: 66, dependent unconditional: 4764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20260, independent: 15430, independent conditional: 657, independent unconditional: 14773, dependent: 4830, dependent conditional: 66, dependent unconditional: 4764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 750, independent: 706, independent conditional: 10, independent unconditional: 696, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 750, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23228, independent: 149, independent conditional: 79, independent unconditional: 70, dependent: 23079, dependent conditional: 9, dependent unconditional: 23070, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 20260, independent: 14724, independent conditional: 647, independent unconditional: 14077, dependent: 4786, dependent conditional: 65, dependent unconditional: 4721, unknown: 750, unknown conditional: 11, unknown unconditional: 739] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 706, Positive conditional cache size: 10, Positive unconditional cache size: 696, Negative cache size: 44, Negative conditional cache size: 1, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18801, Maximal queried relation: 4, Independence queries for same thread: 274 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1193; [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, t1194=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1195; [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)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_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0] [L757] 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_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L774] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L777] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L789] 2 return 0; [L794] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L797] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L800] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L828] 3 return 0; [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\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=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L767] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 24.2s, 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: 27, 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-01-23 16:03:05,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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