./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019.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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 01:01:13,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 01:01:13,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 01:01:13,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 01:01:13,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 01:01:13,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 01:01:13,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 01:01:13,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 01:01:13,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 01:01:13,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 01:01:13,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 01:01:13,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 01:01:13,718 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 01:01:13,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 01:01:13,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 01:01:13,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 01:01:13,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 01:01:13,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 01:01:13,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 01:01:13,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 01:01:13,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 01:01:13,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 01:01:13,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 01:01:13,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 01:01:13,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 01:01:13,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 01:01:13,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 01:01:13,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 01:01:13,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 01:01:13,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 01:01:13,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:01:13,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 01:01:13,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 01:01:13,728 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 01:01:13,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 01:01:13,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 01:01:13,729 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 01:01:13,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 01:01:13,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 01:01:13,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 01:01:13,729 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 01:01:13,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 01:01:13,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 01:01:13,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 01:01:13,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 01:01:13,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 01:01:13,995 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 01:01:13,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2024-10-19 01:01:15,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 01:01:15,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 01:01:15,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2024-10-19 01:01:15,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/def878496/c4114be924ad477dbd948e8fa1718dc2/FLAG02ef360e7 [2024-10-19 01:01:15,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/def878496/c4114be924ad477dbd948e8fa1718dc2 [2024-10-19 01:01:15,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 01:01:15,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 01:01:15,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 01:01:15,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 01:01:15,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 01:01:15,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:01:15" (1/1) ... [2024-10-19 01:01:15,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77960202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:15, skipping insertion in model container [2024-10-19 01:01:15,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:01:15" (1/1) ... [2024-10-19 01:01:15,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 01:01:15,950 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i[944,957] [2024-10-19 01:01:16,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:01:16,181 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 01:01:16,194 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i[944,957] [2024-10-19 01:01:16,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:01:16,301 INFO L204 MainTranslator]: Completed translation [2024-10-19 01:01:16,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16 WrapperNode [2024-10-19 01:01:16,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 01:01:16,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 01:01:16,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 01:01:16,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 01:01:16,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,370 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2024-10-19 01:01:16,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 01:01:16,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 01:01:16,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 01:01:16,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 01:01:16,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 01:01:16,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 01:01:16,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 01:01:16,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 01:01:16,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (1/1) ... [2024-10-19 01:01:16,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:01:16,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:01:16,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 01:01:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 01:01:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 01:01:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 01:01:16,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-19 01:01:16,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-19 01:01:16,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-19 01:01:16,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-19 01:01:16,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-19 01:01:16,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-19 01:01:16,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 01:01:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 01:01:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 01:01:16,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 01:01:16,513 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 01:01:16,640 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 01:01:16,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 01:01:16,923 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 01:01:16,924 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 01:01:17,157 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 01:01:17,157 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 01:01:17,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:01:17 BoogieIcfgContainer [2024-10-19 01:01:17,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 01:01:17,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 01:01:17,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 01:01:17,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 01:01:17,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 01:01:15" (1/3) ... [2024-10-19 01:01:17,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cd2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:01:17, skipping insertion in model container [2024-10-19 01:01:17,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:01:16" (2/3) ... [2024-10-19 01:01:17,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cd2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:01:17, skipping insertion in model container [2024-10-19 01:01:17,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:01:17" (3/3) ... [2024-10-19 01:01:17,170 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2024-10-19 01:01:17,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 01:01:17,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 01:01:17,187 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 01:01:17,247 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-19 01:01:17,294 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 01:01:17,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 01:01:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:01:17,297 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) [2024-10-19 01:01:17,299 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 [2024-10-19 01:01:17,388 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 01:01:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:01:17,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork2 ======== [2024-10-19 01:01:17,419 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;@38bdec7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 01:01:17,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 01:01:26,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 01:01:26,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:01:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1850280152, now seen corresponding path program 1 times [2024-10-19 01:01:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:01:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848240494] [2024-10-19 01:01:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:01:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:01:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:01:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:01:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:01:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848240494] [2024-10-19 01:01:27,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848240494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:01:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:01:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 01:01:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666381077] [2024-10-19 01:01:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:01:27,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 01:01:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:01:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:01:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:01:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:01:27,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:01:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:01:27,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:01:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -252877380, now seen corresponding path program 1 times [2024-10-19 01:01:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:01:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:01:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:01:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:01:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:01:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:01:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:01:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:01:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:01:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:01:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 809397798, now seen corresponding path program 1 times [2024-10-19 01:01:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:01:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:01:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:01:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:01:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:01:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:01:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:01:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:01:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 01:01:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-19 01:02:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash -678475311, now seen corresponding path program 1 times [2024-10-19 01:02:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:02:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:02:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:02:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:02:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:02:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:02:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:02:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:02:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 01:02:07,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-19 01:02:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:02:45,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 01:02:45,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-19 01:02:45,418 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-19 01:02:45,421 INFO L312 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (1/2) [2024-10-19 01:02:45,428 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 01:02:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 01:02:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:02:45,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 01:02:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-19 01:02:45,480 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 01:02:45,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:02:45,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 01:02:45,486 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;@38bdec7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 01:02:45,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-19 01:02:52,265 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)] === [2024-10-19 01:02:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:02:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1330042140, now seen corresponding path program 1 times [2024-10-19 01:02:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:02:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697458725] [2024-10-19 01:02:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:02:52,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:02:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:02:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:02:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:02:52,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697458725] [2024-10-19 01:02:52,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697458725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:02:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:02:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 01:02:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509731211] [2024-10-19 01:02:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:02:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 01:02:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:02:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:02:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:02:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:02:52,639 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:02:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:02:52,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:03:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:03:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-19 01:03:00,216 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)] === [2024-10-19 01:03:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:03:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1163454534, now seen corresponding path program 1 times [2024-10-19 01:03:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:03:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624109396] [2024-10-19 01:03:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:03:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:03:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:03:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624109396] [2024-10-19 01:03:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624109396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:03:00,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:03:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-19 01:03:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213368890] [2024-10-19 01:03:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:03:00,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 01:03:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:03:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 01:03:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-19 01:03:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:03:00,486 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:03:00,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:03:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:03:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:03:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash -688527112, now seen corresponding path program 1 times [2024-10-19 01:03:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:00,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:03:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:03:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2024-10-19 01:03:00,867 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)] === [2024-10-19 01:03:00,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:03:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -254313652, now seen corresponding path program 1 times [2024-10-19 01:03:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:03:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439787412] [2024-10-19 01:03:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:03:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:03:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:03:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439787412] [2024-10-19 01:03:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439787412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:03:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:03:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-19 01:03:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577253723] [2024-10-19 01:03:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:03:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 01:03:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:03:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 01:03:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-19 01:03:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:03:01,186 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:03:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:03:01,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:03:01,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:03:01,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:03:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -688527105, now seen corresponding path program 1 times [2024-10-19 01:03:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1235116195, now seen corresponding path program 1 times [2024-10-19 01:03:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1162698805, now seen corresponding path program 1 times [2024-10-19 01:03:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1625060318, now seen corresponding path program 1 times [2024-10-19 01:03:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:01,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 86127386, now seen corresponding path program 1 times [2024-10-19 01:03:02,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -253441021, now seen corresponding path program 1 times [2024-10-19 01:03:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1660342707, now seen corresponding path program 1 times [2024-10-19 01:03:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 694349037, now seen corresponding path program 1 times [2024-10-19 01:03:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash -670337024, now seen corresponding path program 1 times [2024-10-19 01:03:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:02,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1625976404, now seen corresponding path program 1 times [2024-10-19 01:03:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:03:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:03:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:03:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:03:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 01:03:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 01:03:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1134349983, now seen corresponding path program 1 times [2024-10-19 01:03:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:03:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:03:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:03:26,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:03:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 810903851, now seen corresponding path program 1 times [2024-10-19 01:04:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:04:05,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:04:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:05,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:04:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1400240800, now seen corresponding path program 1 times [2024-10-19 01:04:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:04:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:04:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:33,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:04:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1616443701, now seen corresponding path program 1 times [2024-10-19 01:04:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:04:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:04:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:04:50,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:04:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1888563921, now seen corresponding path program 1 times [2024-10-19 01:05:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:05:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:05:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:07,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:05:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:05:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:05:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 01:05:07,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-19 01:05:07,353 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)] === [2024-10-19 01:05:07,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:05:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1132256356, now seen corresponding path program 2 times [2024-10-19 01:05:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:05:07,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283837549] [2024-10-19 01:05:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:05:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:05:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:05:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:05:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:05:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283837549] [2024-10-19 01:05:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283837549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:05:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:05:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-19 01:05:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655952725] [2024-10-19 01:05:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:05:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-19 01:05:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:05:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 01:05:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-19 01:05:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:05:08,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:05:08,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 01:05:08,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:05:08,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:05:08,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-19 01:05:08,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:05:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1134349818, now seen corresponding path program 1 times [2024-10-19 01:05:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:05:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:05:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:26,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:05:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 810904010, now seen corresponding path program 1 times [2024-10-19 01:05:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:05:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:05:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:05:56,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:05:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:06:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:06:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:06:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 01:06:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 01:06:43,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-19 01:06:43,933 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)] === [2024-10-19 01:06:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:06:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1544698142, now seen corresponding path program 3 times [2024-10-19 01:06:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:06:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664328804] [2024-10-19 01:06:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:06:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:06:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:06:43,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:06:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:06:44,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 01:06:44,022 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 01:06:44,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-19 01:06:44,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-10-19 01:06:44,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-19 01:06:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-19 01:06:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-19 01:06:44,025 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 01:06:44,026 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-19 01:06:44,104 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 01:06:44,105 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 01:06:44,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 01:06:44 BasicIcfg [2024-10-19 01:06:44,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 01:06:44,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 01:06:44,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 01:06:44,111 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 01:06:44,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:01:17" (3/4) ... [2024-10-19 01:06:44,112 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 01:06:44,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 01:06:44,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 01:06:44,201 INFO L158 Benchmark]: Toolchain (without parser) took 328500.25ms. Allocated memory was 174.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 115.4MB in the beginning and 956.0MB in the end (delta: -840.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-19 01:06:44,201 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 01:06:44,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.06ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 89.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-19 01:06:44,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.37ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 86.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:06:44,202 INFO L158 Benchmark]: Boogie Preprocessor took 54.71ms. Allocated memory is still 174.1MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:06:44,203 INFO L158 Benchmark]: RCFGBuilder took 732.64ms. Allocated memory was 174.1MB in the beginning and 226.5MB in the end (delta: 52.4MB). Free memory was 84.0MB in the beginning and 178.0MB in the end (delta: -94.0MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-10-19 01:06:44,203 INFO L158 Benchmark]: TraceAbstraction took 326948.41ms. Allocated memory was 226.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 177.0MB in the beginning and 969.7MB in the end (delta: -792.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-19 01:06:44,203 INFO L158 Benchmark]: Witness Printer took 89.88ms. Allocated memory is still 2.1GB. Free memory was 968.6MB in the beginning and 956.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-19 01:06:44,205 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 174.1MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.06ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 89.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.37ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 86.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.71ms. Allocated memory is still 174.1MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 732.64ms. Allocated memory was 174.1MB in the beginning and 226.5MB in the end (delta: 52.4MB). Free memory was 84.0MB in the beginning and 178.0MB in the end (delta: -94.0MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * TraceAbstraction took 326948.41ms. Allocated memory was 226.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 177.0MB in the beginning and 969.7MB in the end (delta: -792.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 89.88ms. Allocated memory is still 2.1GB. Free memory was 968.6MB in the beginning and 956.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 3984, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 76, dependent conditional: 53, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 378, dependent conditional: 332, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, independent: 776, independent conditional: 69, independent unconditional: 707, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74712, independent: 47929, independent conditional: 47775, independent unconditional: 154, dependent: 26782, dependent conditional: 6777, dependent unconditional: 20006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4286, independent: 3132, independent conditional: 543, independent unconditional: 2589, dependent: 353, dependent conditional: 2, dependent unconditional: 351, unknown: 801, unknown conditional: 71, unknown unconditional: 730] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 776, Positive conditional cache size: 69, Positive unconditional cache size: 707, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2888, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 378, dependent conditional: 332, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, independent: 776, independent conditional: 69, independent unconditional: 707, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74712, independent: 47929, independent conditional: 47775, independent unconditional: 154, dependent: 26782, dependent conditional: 6777, dependent unconditional: 20006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4286, independent: 3132, independent conditional: 543, independent unconditional: 2589, dependent: 353, dependent conditional: 2, dependent unconditional: 351, unknown: 801, unknown conditional: 71, unknown unconditional: 730] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 776, Positive conditional cache size: 69, Positive unconditional cache size: 707, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2888 ], Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 20.2s, Number of persistent set computation: 317, Number of trivial persistent sets: 124, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 730, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3984, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 76, dependent conditional: 53, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3982, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 74, dependent conditional: 51, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 378, dependent conditional: 332, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, independent: 776, independent conditional: 69, independent unconditional: 707, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74712, independent: 47929, independent conditional: 47775, independent unconditional: 154, dependent: 26782, dependent conditional: 6777, dependent unconditional: 20006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4286, independent: 3132, independent conditional: 543, independent unconditional: 2589, dependent: 353, dependent conditional: 2, dependent unconditional: 351, unknown: 801, unknown conditional: 71, unknown unconditional: 730] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 776, Positive conditional cache size: 69, Positive unconditional cache size: 707, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2888, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 3172, independent unconditional: 736, dependent: 378, dependent conditional: 332, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4286, independent: 3908, independent conditional: 612, independent unconditional: 3296, dependent: 378, dependent conditional: 4, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, independent: 776, independent conditional: 69, independent unconditional: 707, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 65, independent conditional: 59, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74712, independent: 47929, independent conditional: 47775, independent unconditional: 154, dependent: 26782, dependent conditional: 6777, dependent unconditional: 20006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4286, independent: 3132, independent conditional: 543, independent unconditional: 2589, dependent: 353, dependent conditional: 2, dependent unconditional: 351, unknown: 801, unknown conditional: 71, unknown unconditional: 730] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 776, Positive conditional cache size: 69, Positive unconditional cache size: 707, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2888 ], Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11271, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 226, dependent conditional: 200, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 1196, dependent conditional: 1144, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 955, independent: 885, independent conditional: 234, independent unconditional: 651, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 955, independent: 665, independent conditional: 0, independent unconditional: 665, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160906, independent: 8151, independent conditional: 8084, independent unconditional: 68, dependent: 152754, dependent conditional: 114105, dependent unconditional: 38650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12241, independent: 10160, independent conditional: 2690, independent unconditional: 7470, dependent: 1126, dependent conditional: 71, dependent unconditional: 1055, unknown: 955, unknown conditional: 277, unknown unconditional: 678] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 885, Positive conditional cache size: 234, Positive unconditional cache size: 651, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8433, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 1196, dependent conditional: 1144, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 955, independent: 885, independent conditional: 234, independent unconditional: 651, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 955, independent: 665, independent conditional: 0, independent unconditional: 665, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160906, independent: 8151, independent conditional: 8084, independent unconditional: 68, dependent: 152754, dependent conditional: 114105, dependent unconditional: 38650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12241, independent: 10160, independent conditional: 2690, independent unconditional: 7470, dependent: 1126, dependent conditional: 71, dependent unconditional: 1055, unknown: 955, unknown conditional: 277, unknown unconditional: 678] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 885, Positive conditional cache size: 234, Positive unconditional cache size: 651, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8433 ], Independence queries for same thread: 19, Persistent sets #1 benchmarks: Persistent set computation time: 37.6s, Number of persistent set computation: 521, Number of trivial persistent sets: 272, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 677, independent: 651, independent conditional: 0, independent unconditional: 651, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11271, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 226, dependent conditional: 200, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11252, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 207, dependent conditional: 181, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 1196, dependent conditional: 1144, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 955, independent: 885, independent conditional: 234, independent unconditional: 651, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 955, independent: 665, independent conditional: 0, independent unconditional: 665, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160906, independent: 8151, independent conditional: 8084, independent unconditional: 68, dependent: 152754, dependent conditional: 114105, dependent unconditional: 38650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12241, independent: 10160, independent conditional: 2690, independent unconditional: 7470, dependent: 1126, dependent conditional: 71, dependent unconditional: 1055, unknown: 955, unknown conditional: 277, unknown unconditional: 678] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 885, Positive conditional cache size: 234, Positive unconditional cache size: 651, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8433, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 10327, independent unconditional: 718, dependent: 1196, dependent conditional: 1144, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12241, independent: 11045, independent conditional: 2924, independent unconditional: 8121, dependent: 1196, dependent conditional: 114, dependent unconditional: 1082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 955, independent: 885, independent conditional: 234, independent unconditional: 651, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 955, independent: 665, independent conditional: 0, independent unconditional: 665, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 290, independent: 220, independent conditional: 212, independent unconditional: 8, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160906, independent: 8151, independent conditional: 8084, independent unconditional: 68, dependent: 152754, dependent conditional: 114105, dependent unconditional: 38650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12241, independent: 10160, independent conditional: 2690, independent unconditional: 7470, dependent: 1126, dependent conditional: 71, dependent unconditional: 1055, unknown: 955, unknown conditional: 277, unknown unconditional: 678] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 885, Positive conditional cache size: 234, Positive unconditional cache size: 651, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8433 ], 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, t501=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L783] 2 return 0; [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: P2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 88.1s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 87.0s, 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.7s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 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: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 51.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 8, ConditionalCommutativityTraceChecks: 3, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 238.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 236.0s, 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: 24, 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.2s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 702 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: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 154.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 23, ConditionalCommutativityTraceChecks: 18, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-19 01:06:44,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-10-19 01:06:44,449 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 [2024-10-19 01:06:44,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE