./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --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/mix010.opt.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --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-18 19:04:01,296 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-18 19:04:01,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-18 19:04:01,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-18 19:04:01,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-18 19:04:01,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-18 19:04:01,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-18 19:04:01,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-18 19:04:01,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-18 19:04:01,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-18 19:04:01,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-18 19:04:01,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-18 19:04:01,407 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-18 19:04:01,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-18 19:04:01,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-18 19:04:01,410 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-18 19:04:01,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-18 19:04:01,410 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-18 19:04:01,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-18 19:04:01,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-18 19:04:01,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-18 19:04:01,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-18 19:04:01,412 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-18 19:04:01,412 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-18 19:04:01,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-18 19:04:01,413 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-18 19:04:01,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-18 19:04:01,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-18 19:04:01,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-18 19:04:01,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-18 19:04:01,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 19:04:01,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-18 19:04:01,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-18 19:04:01,416 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-18 19:04:01,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-18 19:04:01,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-18 19:04:01,416 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-18 19:04:01,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-18 19:04:01,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-18 19:04:01,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-18 19:04:01,418 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-18 19:04:01,419 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
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 -> DEFAULT
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-18 19:04:01,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-18 19:04:01,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-18 19:04:01,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-18 19:04:01,711 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-18 19:04:01,712 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-18 19:04:01,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2024-10-18 19:04:03,151 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-18 19:04:03,445 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-18 19:04:03,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2024-10-18 19:04:03,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18cbd7b8e/c05b8e3c76ea4832b1aae23b7a792c72/FLAG8f49f8be3
[2024-10-18 19:04:03,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18cbd7b8e/c05b8e3c76ea4832b1aae23b7a792c72
[2024-10-18 19:04:03,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-18 19:04:03,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-18 19:04:03,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-18 19:04:03,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-18 19:04:03,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-18 19:04:03,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 07:04:03" (1/1) ...
[2024-10-18 19:04:03,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d8ab92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:03, skipping insertion in model container
[2024-10-18 19:04:03,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 07:04:03" (1/1) ...
[2024-10-18 19:04:03,561 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-18 19:04:03,730 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/mix010.opt.i[944,957]
[2024-10-18 19:04:03,918 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 19:04:03,933 INFO L200 MainTranslator]: Completed pre-run
[2024-10-18 19:04:03,949 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/mix010.opt.i[944,957]
[2024-10-18 19:04:04,030 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 19:04:04,066 INFO L204 MainTranslator]: Completed translation
[2024-10-18 19:04:04,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04 WrapperNode
[2024-10-18 19:04:04,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-18 19:04:04,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-18 19:04:04,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-18 19:04:04,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-18 19:04:04,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,154 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141
[2024-10-18 19:04:04,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-18 19:04:04,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-18 19:04:04,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-18 19:04:04,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-18 19:04:04,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-18 19:04:04,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-18 19:04:04,226 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-18 19:04:04,226 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-18 19:04:04,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (1/1) ...
[2024-10-18 19:04:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 19:04:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 19:04:04,265 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-18 19:04:04,267 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-18 19:04:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-18 19:04:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-18 19:04:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-18 19:04:04,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-18 19:04:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-18 19:04:04,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-18 19:04:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-10-18 19:04:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-10-18 19:04:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-18 19:04:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-18 19:04:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-18 19:04:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-18 19:04:04,315 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-18 19:04:04,483 INFO L238 CfgBuilder]: Building ICFG
[2024-10-18 19:04:04,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-18 19:04:04,823 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-18 19:04:04,824 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-18 19:04:05,046 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-18 19:04:05,047 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-18 19:04:05,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 07:04:05 BoogieIcfgContainer
[2024-10-18 19:04:05,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-18 19:04:05,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-18 19:04:05,051 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-18 19:04:05,054 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-18 19:04:05,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 07:04:03" (1/3) ...
[2024-10-18 19:04:05,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5c7d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 07:04:05, skipping insertion in model container
[2024-10-18 19:04:05,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 07:04:04" (2/3) ...
[2024-10-18 19:04:05,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5c7d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 07:04:05, skipping insertion in model container
[2024-10-18 19:04:05,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 07:04:05" (3/3) ...
[2024-10-18 19:04:05,057 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i
[2024-10-18 19:04:05,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-18 19:04:05,075 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-18 19:04:05,076 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-18 19:04:05,146 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-18 19:04:05,192 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 19:04:05,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 19:04:05,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 19:04:05,195 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-18 19:04:05,197 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-18 19:04:05,300 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 19:04:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:04:05,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork0 ========
[2024-10-18 19:04:05,334 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;@419de2c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-18 19:04:05,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-18 19:04:16,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-18 19:04:16,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:04:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 853821834, now seen corresponding path program 1 times
[2024-10-18 19:04:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:04:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407273142]
[2024-10-18 19:04:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:04:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:04:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:04:17,038 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-18 19:04:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 19:04:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407273142]
[2024-10-18 19:04:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407273142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 19:04:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 19:04:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-18 19:04:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483304132]
[2024-10-18 19:04:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 19:04:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-18 19:04:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 19:04:17,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-18 19:04:17,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-18 19:04:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:04:17,079 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 19:04:17,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 19:04:17,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:04:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1487717475, now seen corresponding path program 1 times
[2024-10-18 19:04:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:04:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:04:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:04:19,690 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-18 19:04:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:04:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:04:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:04:19,753 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-18 19:04:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-18 19:04:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-18 19:04:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1336628651, now seen corresponding path program 1 times
[2024-10-18 19:04:38,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:04:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:04:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:04:38,946 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-18 19:04:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:04:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:04:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:04:39,037 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-18 19:04:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-18 19:04:39,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-18 19:05:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1514181704, now seen corresponding path program 1 times
[2024-10-18 19:05:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:05:04,913 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-18 19:05:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:05:05,004 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-18 19:05:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-18 19:05:05,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-18 19:05:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash 354849161, now seen corresponding path program 1 times
[2024-10-18 19:05:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:05,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1812583380, now seen corresponding path program 1 times
[2024-10-18 19:05:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1443959309, now seen corresponding path program 1 times
[2024-10-18 19:05:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1784699012, now seen corresponding path program 1 times
[2024-10-18 19:05:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1443065581, now seen corresponding path program 1 times
[2024-10-18 19:05:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:05:07,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-18 19:05:07,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable9,SelfDestructingSolverStorable0
[2024-10-18 19:05:07,311 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-18 19:05:07,314 INFO L312 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2)
[2024-10-18 19:05:07,317 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 19:05:07,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 19:05:07,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 19:05:07,333 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-18 19:05:07,334 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-18 19:05:07,374 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 19:05:07,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:05:07,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-18 19:05:07,377 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;@419de2c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-18 19:05:07,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-10-18 19:05:16,745 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-18 19:05:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:05:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash -586786266, now seen corresponding path program 1 times
[2024-10-18 19:05:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:05:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265460295]
[2024-10-18 19:05:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:05:17,122 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-18 19:05:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 19:05:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265460295]
[2024-10-18 19:05:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265460295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 19:05:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 19:05:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-18 19:05:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602291009]
[2024-10-18 19:05:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 19:05:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-18 19:05:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 19:05:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-18 19:05:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-18 19:05:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:17,125 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 19:05:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 19:05:17,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:05:24,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-18 19:05:24,079 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-18 19:05:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:05:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2121239152, now seen corresponding path program 1 times
[2024-10-18 19:05:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:05:24,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227825596]
[2024-10-18 19:05:24,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:24,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:05:24,381 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-18 19:05:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 19:05:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227825596]
[2024-10-18 19:05:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227825596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 19:05:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 19:05:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-18 19:05:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160113569]
[2024-10-18 19:05:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 19:05:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 19:05:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 19:05:24,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 19:05:24,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-18 19:05:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:24,386 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 19:05:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 19:05:24,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:05:24,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1662881916, now seen corresponding path program 1 times
[2024-10-18 19:05:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:24,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:05:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:05:24,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14
[2024-10-18 19:05:24,794 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-18 19:05:24,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:05:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992110, now seen corresponding path program 1 times
[2024-10-18 19:05:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:05:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061097639]
[2024-10-18 19:05:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:05:25,073 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-18 19:05:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 19:05:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061097639]
[2024-10-18 19:05:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061097639] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 19:05:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 19:05:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 19:05:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292248288]
[2024-10-18 19:05:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 19:05:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 19:05:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 19:05:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-18 19:05:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-18 19:05:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:25,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 19:05:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 19:05:25,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:05:25,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:05:25,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:05:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1662881923, now seen corresponding path program 1 times
[2024-10-18 19:05:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash -298093249, now seen corresponding path program 1 times
[2024-10-18 19:05:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1875946559, now seen corresponding path program 1 times
[2024-10-18 19:05:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 770770498, now seen corresponding path program 1 times
[2024-10-18 19:05:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1410337617, now seen corresponding path program 1 times
[2024-10-18 19:05:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -131788709, now seen corresponding path program 1 times
[2024-10-18 19:05:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1029487509, now seen corresponding path program 1 times
[2024-10-18 19:05:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash -503796657, now seen corresponding path program 1 times
[2024-10-18 19:05:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash 676486092, now seen corresponding path program 1 times
[2024-10-18 19:05:26,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:26,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash 284643699, now seen corresponding path program 1 times
[2024-10-18 19:05:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:05:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:05:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:05:55,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:06:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1335636935, now seen corresponding path program 1 times
[2024-10-18 19:06:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:06:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:06:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:06:37,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:06:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:06:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1249062401, now seen corresponding path program 1 times
[2024-10-18 19:06:49,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:06:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:06:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:06:49,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:06:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1425108422, now seen corresponding path program 1 times
[2024-10-18 19:07:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:01,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:07:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash 647243925, now seen corresponding path program 1 times
[2024-10-18 19:07:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:07:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1151069748, now seen corresponding path program 1 times
[2024-10-18 19:07:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:07:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -591299013, now seen corresponding path program 1 times
[2024-10-18 19:07:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:07:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:07:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:07:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:07:15,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28
[2024-10-18 19:07:15,779 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-18 19:07:15,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:07:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1710350074, now seen corresponding path program 2 times
[2024-10-18 19:07:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:07:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718491350]
[2024-10-18 19:07:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 19:07:17,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-18 19:07:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 19:07:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718491350]
[2024-10-18 19:07:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718491350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 19:07:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 19:07:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-10-18 19:07:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636627215]
[2024-10-18 19:07:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 19:07:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-18 19:07:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 19:07:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-18 19:07:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-10-18 19:07:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:07:17,160 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 19:07:17,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-18 19:07:17,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:07:17,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:07:17,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:07:17,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 19:07:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 284643892, now seen corresponding path program 1 times
[2024-10-18 19:07:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:07:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:07:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:07:41,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:07:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1335636744, now seen corresponding path program 1 times
[2024-10-18 19:08:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:08:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:08:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:08,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:08:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1151069516, now seen corresponding path program 1 times
[2024-10-18 19:08:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:08:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:08:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:40,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:08:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -591298781, now seen corresponding path program 1 times
[2024-10-18 19:08:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:08:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:08:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:41,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:08:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1089320578, now seen corresponding path program 1 times
[2024-10-18 19:08:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:08:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:08:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:08:41,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:08:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:09:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 19:09:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:09:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-18 19:09:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-10-18 19:09:03,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37
[2024-10-18 19:09:03,169 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-18 19:09:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 19:09:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash -354895068, now seen corresponding path program 3 times
[2024-10-18 19:09:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 19:09:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843144831]
[2024-10-18 19:09:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 19:09:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 19:09:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:09:03,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 19:09:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 19:09:03,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-18 19:09:03,264 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-18 19:09:03,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2024-10-18 19:09:03,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2024-10-18 19:09:03,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2024-10-18 19:09:03,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2024-10-18 19:09:03,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-10-18 19:09:03,269 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, 1, 1, 1, 1]
[2024-10-18 19:09:03,270 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2)
[2024-10-18 19:09:03,353 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-18 19:09:03,353 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-18 19:09:03,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 07:09:03 BasicIcfg
[2024-10-18 19:09:03,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-18 19:09:03,360 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-18 19:09:03,362 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-18 19:09:03,363 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-18 19:09:03,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 07:04:05" (3/4) ...
[2024-10-18 19:09:03,364 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-18 19:09:03,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-18 19:09:03,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-18 19:09:03,468 INFO L158 Benchmark]: Toolchain (without parser) took 299978.05ms. Allocated memory was 132.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 77.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 572.1MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,469 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory was 93.4MB in the beginning and 93.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 19:09:03,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.85ms. Allocated memory is still 132.1MB. Free memory was 77.6MB in the beginning and 51.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.62ms. Allocated memory is still 132.1MB. Free memory was 51.3MB in the beginning and 102.1MB in the end (delta: -50.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,469 INFO L158 Benchmark]: Boogie Preprocessor took 68.46ms. Allocated memory is still 132.1MB. Free memory was 102.1MB in the beginning and 100.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,470 INFO L158 Benchmark]: RCFGBuilder took 821.66ms. Allocated memory is still 132.1MB. Free memory was 100.3MB in the beginning and 45.7MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,470 INFO L158 Benchmark]: TraceAbstraction took 298308.89ms. Allocated memory was 132.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 44.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 523.6MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,470 INFO L158 Benchmark]: Witness Printer took 107.94ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-10-18 19:09:03,472 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.24ms. Allocated memory is still 132.1MB. Free memory was 93.4MB in the beginning and 93.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 573.85ms. Allocated memory is still 132.1MB. Free memory was 77.6MB in the beginning and 51.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 86.62ms. Allocated memory is still 132.1MB. Free memory was 51.3MB in the beginning and 102.1MB in the end (delta: -50.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 68.46ms. Allocated memory is still 132.1MB. Free memory was 102.1MB in the beginning and 100.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 821.66ms. Allocated memory is still 132.1MB. Free memory was 100.3MB in the beginning and 45.7MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 298308.89ms. Allocated memory was 132.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 44.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 523.6MB. Max. memory is 16.1GB.
* Witness Printer took 107.94ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 174, dependent conditional: 134, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, independent: 718, independent conditional: 59, independent unconditional: 659, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46163, independent: 16123, independent conditional: 15934, independent unconditional: 189, dependent: 30040, dependent conditional: 7874, dependent unconditional: 22166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3150, independent: 2258, independent conditional: 370, independent unconditional: 1888, dependent: 152, dependent conditional: 2, dependent unconditional: 150, unknown: 740, unknown conditional: 61, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 718, Positive conditional cache size: 59, Positive unconditional cache size: 659, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1983, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 174, dependent conditional: 134, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, independent: 718, independent conditional: 59, independent unconditional: 659, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46163, independent: 16123, independent conditional: 15934, independent unconditional: 189, dependent: 30040, dependent conditional: 7874, dependent unconditional: 22166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3150, independent: 2258, independent conditional: 370, independent unconditional: 1888, dependent: 152, dependent conditional: 2, dependent unconditional: 150, unknown: 740, unknown conditional: 61, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 718, Positive conditional cache size: 59, Positive unconditional cache size: 659, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1983 ], Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 22.4s, Number of persistent set computation: 202, Number of trivial persistent sets: 83, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 679, independent: 659, independent conditional: 0, independent unconditional: 659, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3015, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 39, dependent conditional: 19, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 174, dependent conditional: 134, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, independent: 718, independent conditional: 59, independent unconditional: 659, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46163, independent: 16123, independent conditional: 15934, independent unconditional: 189, dependent: 30040, dependent conditional: 7874, dependent unconditional: 22166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3150, independent: 2258, independent conditional: 370, independent unconditional: 1888, dependent: 152, dependent conditional: 2, dependent unconditional: 150, unknown: 740, unknown conditional: 61, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 718, Positive conditional cache size: 59, Positive unconditional cache size: 659, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1983, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 2282, independent unconditional: 694, dependent: 174, dependent conditional: 134, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3150, independent: 2976, independent conditional: 429, independent unconditional: 2547, dependent: 174, dependent conditional: 4, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, independent: 718, independent conditional: 59, independent unconditional: 659, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 41, independent unconditional: 6, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46163, independent: 16123, independent conditional: 15934, independent unconditional: 189, dependent: 30040, dependent conditional: 7874, dependent unconditional: 22166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3150, independent: 2258, independent conditional: 370, independent unconditional: 1888, dependent: 152, dependent conditional: 2, dependent unconditional: 150, unknown: 740, unknown conditional: 61, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 718, Positive conditional cache size: 59, Positive unconditional cache size: 659, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1983 ], Independence queries for same thread: 0
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11751, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 217, dependent conditional: 191, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 1124, dependent conditional: 1072, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1064, independent: 1007, independent conditional: 254, independent unconditional: 753, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1064, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142514, independent: 9038, independent conditional: 8968, independent unconditional: 70, dependent: 133476, dependent conditional: 78908, dependent unconditional: 54567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12658, independent: 10527, independent conditional: 3083, independent unconditional: 7444, dependent: 1067, dependent conditional: 48, dependent unconditional: 1019, unknown: 1064, unknown conditional: 284, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1007, Positive conditional cache size: 254, Positive unconditional cache size: 753, Negative cache size: 57, Negative conditional cache size: 30, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8365, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 1124, dependent conditional: 1072, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1064, independent: 1007, independent conditional: 254, independent unconditional: 753, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1064, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142514, independent: 9038, independent conditional: 8968, independent unconditional: 70, dependent: 133476, dependent conditional: 78908, dependent unconditional: 54567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12658, independent: 10527, independent conditional: 3083, independent unconditional: 7444, dependent: 1067, dependent conditional: 48, dependent unconditional: 1019, unknown: 1064, unknown conditional: 284, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1007, Positive conditional cache size: 254, Positive unconditional cache size: 753, Negative cache size: 57, Negative conditional cache size: 30, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8365 ], Independence queries for same thread: 19, Persistent sets #1 benchmarks: Persistent set computation time: 39.6s, Number of persistent set computation: 691, Number of trivial persistent sets: 360, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 779, independent: 753, independent conditional: 0, independent unconditional: 753, 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: 11751, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 217, dependent conditional: 191, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11732, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 198, dependent conditional: 172, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 1124, dependent conditional: 1072, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1064, independent: 1007, independent conditional: 254, independent unconditional: 753, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1064, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142514, independent: 9038, independent conditional: 8968, independent unconditional: 70, dependent: 133476, dependent conditional: 78908, dependent unconditional: 54567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12658, independent: 10527, independent conditional: 3083, independent unconditional: 7444, dependent: 1067, dependent conditional: 48, dependent unconditional: 1019, unknown: 1064, unknown conditional: 284, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1007, Positive conditional cache size: 254, Positive unconditional cache size: 753, Negative cache size: 57, Negative conditional cache size: 30, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8365, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 10708, independent unconditional: 826, dependent: 1124, dependent conditional: 1072, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12658, independent: 11534, independent conditional: 3337, independent unconditional: 8197, dependent: 1124, dependent conditional: 78, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1064, independent: 1007, independent conditional: 254, independent unconditional: 753, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1064, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 222, independent conditional: 214, independent unconditional: 8, dependent: 57, dependent conditional: 30, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142514, independent: 9038, independent conditional: 8968, independent unconditional: 70, dependent: 133476, dependent conditional: 78908, dependent unconditional: 54567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12658, independent: 10527, independent conditional: 3083, independent unconditional: 7444, dependent: 1067, dependent conditional: 48, dependent unconditional: 1019, unknown: 1064, unknown conditional: 284, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1007, Positive conditional cache size: 254, Positive unconditional cache size: 753, Negative cache size: 57, Negative conditional cache size: 30, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8365 ], Independence queries for same thread: 19
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L717] 0 int __unbuffered_p2_EAX = 0;
[L719] 0 int __unbuffered_p2_EBX = 0;
[L721] 0 int a = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L729] 0 int z = 0;
[L730] 0 _Bool z$flush_delayed;
[L731] 0 int z$mem_tmp;
[L732] 0 _Bool z$r_buff0_thd0;
[L733] 0 _Bool z$r_buff0_thd1;
[L734] 0 _Bool z$r_buff0_thd2;
[L735] 0 _Bool z$r_buff0_thd3;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$read_delayed;
[L741] 0 int *z$read_delayed_var;
[L742] 0 int z$w_buff0;
[L743] 0 _Bool z$w_buff0_used;
[L744] 0 int z$w_buff1;
[L745] 0 _Bool z$w_buff1_used;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L853] 0 pthread_t t260;
[L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L855] 0 pthread_t t261;
[L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L857] 0 pthread_t t262;
[L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800] 3 z$w_buff1 = z$w_buff0
[L801] 3 z$w_buff0 = 1
[L802] 3 z$w_buff1_used = z$w_buff0_used
[L803] 3 z$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L809] 3 z$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 z$flush_delayed = weak$$choice2
[L815] 3 z$mem_tmp = z
[L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = z
[L824] 3 z = z$flush_delayed ? z$mem_tmp : z
[L825] 3 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828] 3 __unbuffered_p2_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L766] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 z$flush_delayed = weak$$choice2
[L778] 2 z$mem_tmp = z
[L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = z
[L787] 2 z = z$flush_delayed ? z$mem_tmp : z
[L788] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L795] 2 return 0;
[L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L840] 3 return 0;
[L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L862] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L862] RET 0 assume_abort_if_not(main$tmp_guard0)
[L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L873] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances
CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 62.0s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 61.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 147 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: 29.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 8, ConditionalCommutativityTraceChecks: 8, ConditionalCommutativityImperfectProofs: 0
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 235.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 233.4s, 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: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 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: 165.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 22, ConditionalCommutativityTraceChecks: 22, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-18 19:09:03,518 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-18 19:09:03,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-10-18 19:09:03,912 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