./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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/mix010.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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 00:14:38,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 00:14:38,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 00:14:38,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 00:14:38,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 00:14:38,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 00:14:38,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 00:14:38,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 00:14:38,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 00:14:38,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 00:14:38,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 00:14:38,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 00:14:38,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 00:14:38,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:14:38,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:14:38,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:14:38,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 00:14:38,083 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 00:14:38,083 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-04-25 00:14:38,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 00:14:38,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 00:14:38,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 00:14:38,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 00:14:38,315 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 00:14:38,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-04-25 00:14:39,608 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be16325d6/fdca1cdb1a39490789bbcfef00abc18a/FLAGbd411a523 [2025-04-25 00:14:39,898 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 00:14:39,901 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2025-04-25 00:14:39,916 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be16325d6/fdca1cdb1a39490789bbcfef00abc18a/FLAGbd411a523 [2025-04-25 00:14:40,808 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be16325d6/fdca1cdb1a39490789bbcfef00abc18a [2025-04-25 00:14:40,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 00:14:40,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 00:14:40,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 00:14:40,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 00:14:40,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 00:14:40,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:14:40" (1/1) ... [2025-04-25 00:14:40,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713bf53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:40, skipping insertion in model container [2025-04-25 00:14:40,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:14:40" (1/1) ... [2025-04-25 00:14:40,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 00:14:40,974 WARN L116 LibraryModelHandler]: 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/mix010.opt.i[944,957] [2025-04-25 00:14:41,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:14:41,098 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 00:14:41,116 WARN L116 LibraryModelHandler]: 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/mix010.opt.i[944,957] [2025-04-25 00:14:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:14:41,219 INFO L204 MainTranslator]: Completed translation [2025-04-25 00:14:41,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41 WrapperNode [2025-04-25 00:14:41,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 00:14:41,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 00:14:41,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 00:14:41,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 00:14:41,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,278 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2025-04-25 00:14:41,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 00:14:41,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 00:14:41,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 00:14:41,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 00:14:41,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 00:14:41,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 00:14:41,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 00:14:41,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 00:14:41,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (1/1) ... [2025-04-25 00:14:41,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:14:41,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:14:41,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 00:14:41,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 00:14:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-25 00:14:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-25 00:14:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-25 00:14:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-25 00:14:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 00:14:41,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 00:14:41,374 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 00:14:41,480 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 00:14:41,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 00:14:41,707 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 00:14:41,707 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 00:14:41,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 00:14:41,887 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 00:14:41,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:14:41 BoogieIcfgContainer [2025-04-25 00:14:41,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 00:14:41,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 00:14:41,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 00:14:41,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 00:14:41,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 12:14:40" (1/3) ... [2025-04-25 00:14:41,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315138e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:14:41, skipping insertion in model container [2025-04-25 00:14:41,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:14:41" (2/3) ... [2025-04-25 00:14:41,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315138e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:14:41, skipping insertion in model container [2025-04-25 00:14:41,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:14:41" (3/3) ... [2025-04-25 00:14:41,896 INFO L128 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2025-04-25 00:14:41,906 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 00:14:41,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix010.opt.i that has 4 procedures, 42 locations, 39 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-25 00:14:41,908 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 00:14:41,969 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-25 00:14:42,005 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:14:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 00:14:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:14:42,009 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-04-25 00:14:42,011 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-04-25 00:14:42,079 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:14:42,084 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork0 ======== [2025-04-25 00:14:42,089 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;@184dc89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:14:42,089 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 00:14:42,112 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:14:42,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 853821834, now seen corresponding path program 1 times [2025-04-25 00:14:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:42,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689378330] [2025-04-25 00:14:42,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:14:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 00:14:42,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 00:14:42,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:14:42,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:14:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:14:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:14:42,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689378330] [2025-04-25 00:14:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689378330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:14:42,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:14:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 00:14:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927745021] [2025-04-25 00:14:42,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:14:42,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:14:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:14:42,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:14:42,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:14:42,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:42,891 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:14:42,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 00:14:42,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:43,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:43,378 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 00:14:43,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 00:14:43,384 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-25 00:14:43,385 INFO L320 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2025-04-25 00:14:43,387 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:14:43,388 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:14:43,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 00:14:43,388 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;@184dc89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:14:43,388 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 00:14:43,391 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 1 more)] === [2025-04-25 00:14:43,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -586786266, now seen corresponding path program 1 times [2025-04-25 00:14:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:43,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736003574] [2025-04-25 00:14:43,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:14:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 00:14:43,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 00:14:43,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:14:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:14:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:14:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:14:43,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736003574] [2025-04-25 00:14:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736003574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:14:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:14:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:14:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621450810] [2025-04-25 00:14:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:14:43,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:14:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:14:43,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:14:43,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:14:43,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:43,871 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:14:43,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-04-25 00:14:43,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:43,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:43,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 00:14:43,939 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 1 more)] === [2025-04-25 00:14:43,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2121239152, now seen corresponding path program 1 times [2025-04-25 00:14:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:43,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127934719] [2025-04-25 00:14:43,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:14:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:43,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-25 00:14:44,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 00:14:44,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:14:44,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:14:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:14:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:14:44,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127934719] [2025-04-25 00:14:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127934719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:14:44,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:14:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 00:14:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349921011] [2025-04-25 00:14:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:14:44,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 00:14:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:14:44,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 00:14:44,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-25 00:14:44,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:44,299 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:14:44,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-04-25 00:14:44,299 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:44,299 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:44,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:44,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:14:44,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 00:14:44,388 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 1 more)] === [2025-04-25 00:14:44,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992110, now seen corresponding path program 1 times [2025-04-25 00:14:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:44,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729252392] [2025-04-25 00:14:44,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:14:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:44,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-25 00:14:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 00:14:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:14:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:14:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:14:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:14:44,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729252392] [2025-04-25 00:14:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729252392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:14:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:14:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-25 00:14:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145000794] [2025-04-25 00:14:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:14:44,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 00:14:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:14:44,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 00:14:44,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-25 00:14:44,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:44,726 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:14:44,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) 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-04-25 00:14:44,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:44,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:14:44,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:45,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:45,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:14:45,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 00:14:45,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 00:14:45,156 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 1 more)] === [2025-04-25 00:14:45,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1710350074, now seen corresponding path program 2 times [2025-04-25 00:14:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:45,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105335219] [2025-04-25 00:14:45,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:14:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:45,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-04-25 00:14:45,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 00:14:45,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 00:14:45,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:14:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:14:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:14:46,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105335219] [2025-04-25 00:14:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105335219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:14:46,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:14:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 00:14:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877902555] [2025-04-25 00:14:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:14:46,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 00:14:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:14:46,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 00:14:46,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-25 00:14:46,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:46,386 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:14:46,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 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-04-25 00:14:46,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:46,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:14:46,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 00:14:46,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:14:46,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:14:46,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:14:46,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 00:14:46,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:14:46,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 00:14:46,720 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 1 more)] === [2025-04-25 00:14:46,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:14:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -354895068, now seen corresponding path program 3 times [2025-04-25 00:14:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:14:46,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260499348] [2025-04-25 00:14:46,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 00:14:46,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:14:46,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-04-25 00:14:46,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 00:14:46,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-25 00:14:46,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 00:14:46,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 00:14:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-25 00:14:46,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 00:14:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:14:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 00:14:46,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 00:14:46,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 00:14:46,838 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-25 00:14:46,838 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-25 00:14:46,838 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-25 00:14:46,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-25 00:14:46,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 00:14:46,841 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-25 00:14:46,841 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2025-04-25 00:14:46,926 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 00:14:46,926 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 00:14:46,941 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-04-25 00:14:46,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:14:46 BasicIcfg [2025-04-25 00:14:46,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 00:14:46,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 00:14:46,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 00:14:46,943 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 00:14:46,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:14:41" (3/4) ... [2025-04-25 00:14:46,945 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-25 00:14:47,036 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-04-25 00:14:47,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 00:14:47,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 00:14:47,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 00:14:47,081 INFO L158 Benchmark]: Toolchain (without parser) took 6270.08ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 122.8MB in the beginning and 242.3MB in the end (delta: -119.5MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,082 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:14:47,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 96.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.12ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 93.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,083 INFO L158 Benchmark]: Boogie Preprocessor took 40.99ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:14:47,084 INFO L158 Benchmark]: RCFGBuilder took 567.66ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 37.7MB in the end (delta: 54.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,084 INFO L158 Benchmark]: TraceAbstraction took 5052.39ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 37.0MB in the beginning and 258.7MB in the end (delta: -221.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,084 INFO L158 Benchmark]: Witness Printer took 137.70ms. Allocated memory is still 469.8MB. Free memory was 258.7MB in the beginning and 242.3MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 00:14:47,086 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 96.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.12ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 93.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.99ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 567.66ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 37.7MB in the end (delta: 54.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5052.39ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 37.0MB in the beginning and 258.7MB in the end (delta: -221.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * Witness Printer took 137.70ms. Allocated memory is still 469.8MB. Free memory was 258.7MB in the beginning and 242.3MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. 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: 7605, independent: 7386, independent conditional: 7386, independent unconditional: 0, dependent: 219, dependent conditional: 219, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7548, independent: 7386, independent conditional: 0, independent unconditional: 7386, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 389, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 389, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7548, independent: 7010, independent conditional: 0, independent unconditional: 7010, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 389, unknown conditional: 0, unknown unconditional: 389] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 376, Positive conditional cache size: 0, Positive unconditional cache size: 376, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 57 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11015, independent: 10652, independent conditional: 10652, independent unconditional: 0, dependent: 363, dependent conditional: 363, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10996, independent: 10652, independent conditional: 0, independent unconditional: 10652, dependent: 344, dependent conditional: 0, dependent unconditional: 344, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10996, independent: 10538, independent conditional: 0, independent unconditional: 10538, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 121, unknown conditional: 0, unknown unconditional: 121] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 490, Positive conditional cache size: 0, Positive unconditional cache size: 490, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 19 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-2, t262=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L828] 3 __unbuffered_p2_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L754] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L772] 2 __unbuffered_p1_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L795] 2 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L838] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] 3 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 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 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L873] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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(expression, Pre)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 854]: 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: 858]: 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: 856]: 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: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 70 locations, 67 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, 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: 3, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 70 locations, 67 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.9s, 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: 26, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 746 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-04-25 00:14:47,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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