./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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/mix046.oepc.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 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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 11:44:22,095 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-18 11:44:22,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-18 11:44:22,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-18 11:44:22,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-18 11:44:22,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-18 11:44:22,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-18 11:44:22,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-18 11:44:22,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-18 11:44:22,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-18 11:44:22,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-18 11:44:22,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-18 11:44:22,223 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-18 11:44:22,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-18 11:44:22,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-18 11:44:22,227 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-18 11:44:22,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-18 11:44:22,227 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-18 11:44:22,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-18 11:44:22,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-18 11:44:22,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-18 11:44:22,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-18 11:44:22,229 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-18 11:44:22,229 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-18 11:44:22,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-18 11:44:22,230 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-18 11:44:22,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-18 11:44:22,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-18 11:44:22,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-18 11:44:22,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-18 11:44:22,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 11:44:22,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-18 11:44:22,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-18 11:44:22,232 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-18 11:44:22,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-18 11:44:22,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-18 11:44:22,233 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-18 11:44:22,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-18 11:44:22,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-18 11:44:22,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-18 11:44:22,234 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-18 11:44:22,234 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 -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8
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 -> IA
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET
[2024-10-18 11:44:22,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-18 11:44:22,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-18 11:44:22,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-18 11:44:22,528 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-18 11:44:22,529 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-18 11:44:22,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i
[2024-10-18 11:44:23,998 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-18 11:44:24,287 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-18 11:44:24,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i
[2024-10-18 11:44:24,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d79cf993d/f1a1c09ca92a41e09e159c52f95fb872/FLAG66d219a8c
[2024-10-18 11:44:24,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d79cf993d/f1a1c09ca92a41e09e159c52f95fb872
[2024-10-18 11:44:24,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-18 11:44:24,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-18 11:44:24,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-18 11:44:24,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-18 11:44:24,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-18 11:44:24,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:24,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f31ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24, skipping insertion in model container
[2024-10-18 11:44:24,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:24,391 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-18 11:44:24,587 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/mix046.oepc.i[945,958]
[2024-10-18 11:44:24,807 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 11:44:24,821 INFO L200 MainTranslator]: Completed pre-run
[2024-10-18 11:44:24,833 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/mix046.oepc.i[945,958]
[2024-10-18 11:44:24,880 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 11:44:24,921 INFO L204 MainTranslator]: Completed translation
[2024-10-18 11:44:24,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24 WrapperNode
[2024-10-18 11:44:24,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-18 11:44:24,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-18 11:44:24,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-18 11:44:24,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-18 11:44:24,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:24,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:24,993 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-10-18 11:44:24,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-18 11:44:24,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-18 11:44:24,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-18 11:44:24,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-18 11:44:25,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-18 11:44:25,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-18 11:44:25,047 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-18 11:44:25,047 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-18 11:44:25,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (1/1) ...
[2024-10-18 11:44:25,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 11:44:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 11:44:25,088 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 11:44:25,091 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 11:44:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-18 11:44:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-18 11:44:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-18 11:44:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-18 11:44:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-18 11:44:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-18 11:44:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-10-18 11:44:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-10-18 11:44:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-10-18 11:44:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-10-18 11:44:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-18 11:44:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-18 11:44:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-18 11:44:25,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-18 11:44:25,140 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 11:44:25,316 INFO L238 CfgBuilder]: Building ICFG
[2024-10-18 11:44:25,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-18 11:44:25,666 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-18 11:44:25,666 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-18 11:44:25,876 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-18 11:44:25,877 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-18 11:44:25,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:44:25 BoogieIcfgContainer
[2024-10-18 11:44:25,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-18 11:44:25,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-18 11:44:25,882 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-18 11:44:25,885 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-18 11:44:25,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 11:44:24" (1/3) ...
[2024-10-18 11:44:25,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47db2edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:44:25, skipping insertion in model container
[2024-10-18 11:44:25,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 11:44:24" (2/3) ...
[2024-10-18 11:44:25,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47db2edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 11:44:25, skipping insertion in model container
[2024-10-18 11:44:25,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:44:25" (3/3) ...
[2024-10-18 11:44:25,888 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i
[2024-10-18 11:44:25,906 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-18 11:44:25,906 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-18 11:44:25,906 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-18 11:44:25,965 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-18 11:44:26,013 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 11:44:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 11:44:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 11:44:26,016 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 11:44:26,018 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 11:44:26,114 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 11:44:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:44:26,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-18 11:44:26,141 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;@54e94457, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-18 11:44:26,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-10-18 11:44:56,574 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 2 more)] ===
[2024-10-18 11:44:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:44:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1147551709, now seen corresponding path program 1 times
[2024-10-18 11:44:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:44:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143344746]
[2024-10-18 11:44:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:44:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:44:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:44:57,525 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 11:44:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:44:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143344746]
[2024-10-18 11:44:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143344746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:44:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:44:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 11:44:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747873211]
[2024-10-18 11:44:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:44:57,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-18 11:44:57,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:44:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-18 11:44:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-18 11:44:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:44:57,580 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:44:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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 11:44:57,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:45:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:45:00,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-18 11:45:00,960 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 2 more)] ===
[2024-10-18 11:45:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:45:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -896177937, now seen corresponding path program 1 times
[2024-10-18 11:45:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:45:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047384162]
[2024-10-18 11:45:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:00,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:01,894 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 11:45:01,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:45:01,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047384162]
[2024-10-18 11:45:01,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047384162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:45:01,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:45:01,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-10-18 11:45:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232640453]
[2024-10-18 11:45:01,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:45:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-18 11:45:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:45:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash -42827043, now seen corresponding path program 1 times
[2024-10-18 11:45:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:45:02,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:45:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:45:02,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-18 11:45:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-10-18 11:45:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:45:02,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:45:02,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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 11:45:02,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:45:02,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:45:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:45:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-10-18 11:45:11,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1
[2024-10-18 11:45:11,639 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 2 more)] ===
[2024-10-18 11:45:11,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:45:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash -359247069, now seen corresponding path program 2 times
[2024-10-18 11:45:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:45:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797259907]
[2024-10-18 11:45:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:12,005 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 11:45:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:45:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797259907]
[2024-10-18 11:45:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797259907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:45:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:45:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-18 11:45:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906117337]
[2024-10-18 11:45:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:45:12,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-18 11:45:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:45:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2116418468, now seen corresponding path program 1 times
[2024-10-18 11:45:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:13,218 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 11:45:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:13,586 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 11:45:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2116418465, now seen corresponding path program 1 times
[2024-10-18 11:45:15,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:16,036 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 11:45:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:45:16,734 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 11:45:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1864756044, now seen corresponding path program 1 times
[2024-10-18 11:45:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:45:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:45:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:45:16,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:45:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:45:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-18 11:45:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182
[2024-10-18 11:45:16,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:45:16,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:45:16,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 11:45:16,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:45:16,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states.
[2024-10-18 11:45:16,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:48:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:48:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-10-18 11:48:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-18 11:48:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-18 11:48:23,959 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 2 more)] ===
[2024-10-18 11:48:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:48:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1376165949, now seen corresponding path program 3 times
[2024-10-18 11:48:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:48:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301433887]
[2024-10-18 11:48:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:48:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:48:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:48:24,215 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 11:48:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:48:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301433887]
[2024-10-18 11:48:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301433887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:48:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:48:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-18 11:48:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571021505]
[2024-10-18 11:48:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:48:24,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-18 11:48:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:48:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash 809134356, now seen corresponding path program 1 times
[2024-10-18 11:48:27,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:48:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:48:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:48:27,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:48:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:48:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -686649034, now seen corresponding path program 1 times
[2024-10-18 11:48:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:48:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:48:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:48:42,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:48:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:48:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 188706197, now seen corresponding path program 1 times
[2024-10-18 11:48:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:48:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:48:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:48:58,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:48:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1554914523, now seen corresponding path program 1 times
[2024-10-18 11:49:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:49:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:49:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:13,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:49:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 957699614, now seen corresponding path program 1 times
[2024-10-18 11:49:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:49:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:49:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:35,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:49:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -376093562, now seen corresponding path program 1 times
[2024-10-18 11:49:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:49:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:49:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:49:51,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:49:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1225990821, now seen corresponding path program 1 times
[2024-10-18 11:50:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:50:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:50:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:50:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1537723996, now seen corresponding path program 1 times
[2024-10-18 11:50:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:50:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:50:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:50:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 424792989, now seen corresponding path program 1 times
[2024-10-18 11:50:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:50:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:50:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:50:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-18 11:50:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-18 11:50:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:50:07,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:50:07,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 11:50:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:50:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states.
[2024-10-18 11:50:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-10-18 11:50:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:50:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:50:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-18 11:50:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-18 11:50:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:50:47,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17
[2024-10-18 11:50:47,052 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 2 more)] ===
[2024-10-18 11:50:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:50:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1531257405, now seen corresponding path program 4 times
[2024-10-18 11:50:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:50:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139511381]
[2024-10-18 11:50:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:50:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:50:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 11:50:47,342 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 11:50:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 11:50:47,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139511381]
[2024-10-18 11:50:47,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139511381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 11:50:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 11:50:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-18 11:50:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145316083]
[2024-10-18 11:50:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 11:50:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-18 11:50:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 11:50:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -357239679, now seen corresponding path program 1 times
[2024-10-18 11:50:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:50:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:50:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:50:50,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:50:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1810459295, now seen corresponding path program 1 times
[2024-10-18 11:51:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:51:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:51:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:05,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:51:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 289650818, now seen corresponding path program 1 times
[2024-10-18 11:51:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:51:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:51:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:21,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:51:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 389228228, now seen corresponding path program 1 times
[2024-10-18 11:51:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:51:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:51:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:51:36,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:51:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash -818839413, now seen corresponding path program 1 times
[2024-10-18 11:52:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:52:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:52:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:00,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:52:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash 385769199, now seen corresponding path program 1 times
[2024-10-18 11:52:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:52:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:52:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:14,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:52:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash -926069614, now seen corresponding path program 1 times
[2024-10-18 11:52:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:52:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:52:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:29,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:52:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1356600115, now seen corresponding path program 1 times
[2024-10-18 11:52:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:52:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:52:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:52:44,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:52:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:01,681 INFO L85 PathProgramCache]: Analyzing trace with hash -895082377, now seen corresponding path program 1 times
[2024-10-18 11:53:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:53:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:53:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:01,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:53:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -895082372, now seen corresponding path program 1 times
[2024-10-18 11:53:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:53:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:53:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:20,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:53:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash -480082246, now seen corresponding path program 1 times
[2024-10-18 11:53:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:53:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:53:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:39,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:53:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-18 11:53:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-18 11:53:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:53:39,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 11:53:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 11:53:39,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:53:39,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-10-18 11:53:39,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-10-18 11:53:39,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:53:39,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 11:53:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-18 11:53:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-18 11:53:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-18 11:53:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:53:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-18 11:53:40,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28
[2024-10-18 11:53:40,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-10-18 11:53:40,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 11:53:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash 780640017, now seen corresponding path program 5 times
[2024-10-18 11:53:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 11:53:40,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007937547]
[2024-10-18 11:53:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 11:53:40,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 11:53:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:40,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 11:53:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 11:53:40,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-18 11:53:40,302 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-18 11:53:40,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-10-18 11:53:40,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining)
[2024-10-18 11:53:40,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-10-18 11:53:40,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-10-18 11:53:40,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-10-18 11:53:40,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-10-18 11:53:40,320 INFO L414 BasicCegarLoop]: Path program histogram: [5, 1, 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 11:53:40,321 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-10-18 11:53:40,437 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-18 11:53:40,438 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-18 11:53:40,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 11:53:40 BasicIcfg
[2024-10-18 11:53:40,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-18 11:53:40,442 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-18 11:53:40,442 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-18 11:53:40,442 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-18 11:53:40,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 11:44:25" (3/4) ...
[2024-10-18 11:53:40,444 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-18 11:53:40,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-18 11:53:40,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-18 11:53:40,567 INFO L158 Benchmark]: Toolchain (without parser) took 556237.39ms. Allocated memory was 157.3MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 101.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 882.8MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,567 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 11:53:40,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.77ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 74.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.10ms. Allocated memory is still 157.3MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,568 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 157.3MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,569 INFO L158 Benchmark]: RCFGBuilder took 831.57ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 69.4MB in the beginning and 134.7MB in the end (delta: -65.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,569 INFO L158 Benchmark]: TraceAbstraction took 554559.72ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 133.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 833.5MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,569 INFO L158 Benchmark]: Witness Printer took 124.99ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-10-18 11:53:40,571 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.18ms. Allocated memory is still 157.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 589.77ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 74.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 70.10ms. Allocated memory is still 157.3MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 51.92ms. Allocated memory is still 157.3MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 831.57ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 69.4MB in the beginning and 134.7MB in the end (delta: -65.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 554559.72ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 133.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 833.5MB. Max. memory is 16.1GB.
* Witness Printer took 124.99ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 237347, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 10789, dependent conditional: 10732, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 77026, dependent conditional: 76912, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1419, independent: 1292, independent conditional: 71, independent unconditional: 1221, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1419, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399507, independent: 91999, independent conditional: 91773, independent unconditional: 226, dependent: 307508, dependent conditional: 222712, dependent unconditional: 84796, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 303584, independent: 225266, independent conditional: 17740, independent unconditional: 207526, dependent: 76899, dependent conditional: 9656, dependent unconditional: 67243, unknown: 1419, unknown conditional: 137, unknown unconditional: 1282] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1292, Positive conditional cache size: 71, Positive unconditional cache size: 1221, Negative cache size: 127, Negative conditional cache size: 66, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 274716, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 77026, dependent conditional: 76912, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1419, independent: 1292, independent conditional: 71, independent unconditional: 1221, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1419, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399507, independent: 91999, independent conditional: 91773, independent unconditional: 226, dependent: 307508, dependent conditional: 222712, dependent unconditional: 84796, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 303584, independent: 225266, independent conditional: 17740, independent unconditional: 207526, dependent: 76899, dependent conditional: 9656, dependent unconditional: 67243, unknown: 1419, unknown conditional: 137, unknown unconditional: 1282] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1292, Positive conditional cache size: 71, Positive unconditional cache size: 1221, Negative cache size: 127, Negative conditional cache size: 66, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 274716 ], Independence queries for same thread: 3894, Persistent sets #1 benchmarks: Persistent set computation time: 82.6s, Number of persistent set computation: 6555, Number of trivial persistent sets: 4650, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1278, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 237347, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 10789, dependent conditional: 10732, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 233453, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 6895, dependent conditional: 6838, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 77026, dependent conditional: 76912, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1419, independent: 1292, independent conditional: 71, independent unconditional: 1221, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1419, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399507, independent: 91999, independent conditional: 91773, independent unconditional: 226, dependent: 307508, dependent conditional: 222712, dependent unconditional: 84796, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 303584, independent: 225266, independent conditional: 17740, independent unconditional: 207526, dependent: 76899, dependent conditional: 9656, dependent unconditional: 67243, unknown: 1419, unknown conditional: 137, unknown unconditional: 1282] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1292, Positive conditional cache size: 71, Positive unconditional cache size: 1221, Negative cache size: 127, Negative conditional cache size: 66, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 274716, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 225337, independent unconditional: 1221, dependent: 77026, dependent conditional: 76912, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303584, independent: 226558, independent conditional: 17811, independent unconditional: 208747, dependent: 77026, dependent conditional: 9722, dependent unconditional: 67304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1419, independent: 1292, independent conditional: 71, independent unconditional: 1221, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1419, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 213, independent: 86, independent conditional: 71, independent unconditional: 15, dependent: 127, dependent conditional: 66, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399507, independent: 91999, independent conditional: 91773, independent unconditional: 226, dependent: 307508, dependent conditional: 222712, dependent unconditional: 84796, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 303584, independent: 225266, independent conditional: 17740, independent unconditional: 207526, dependent: 76899, dependent conditional: 9656, dependent unconditional: 67243, unknown: 1419, unknown conditional: 137, unknown unconditional: 1282] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1292, Positive conditional cache size: 71, Positive unconditional cache size: 1221, Negative cache size: 127, Negative conditional cache size: 66, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 274716 ], Independence queries for same thread: 3894
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L720] 0 int b = 0;
[L721] 0 _Bool b$flush_delayed;
[L722] 0 int b$mem_tmp;
[L723] 0 _Bool b$r_buff0_thd0;
[L724] 0 _Bool b$r_buff0_thd1;
[L725] 0 _Bool b$r_buff0_thd2;
[L726] 0 _Bool b$r_buff0_thd3;
[L727] 0 _Bool b$r_buff0_thd4;
[L728] 0 _Bool b$r_buff1_thd0;
[L729] 0 _Bool b$r_buff1_thd1;
[L730] 0 _Bool b$r_buff1_thd2;
[L731] 0 _Bool b$r_buff1_thd3;
[L732] 0 _Bool b$r_buff1_thd4;
[L733] 0 _Bool b$read_delayed;
[L734] 0 int *b$read_delayed_var;
[L735] 0 int b$w_buff0;
[L736] 0 _Bool b$w_buff0_used;
[L737] 0 int b$w_buff1;
[L738] 0 _Bool b$w_buff1_used;
[L739] 0 _Bool main$tmp_guard0;
[L740] 0 _Bool main$tmp_guard1;
[L742] 0 int x = 0;
[L744] 0 int y = 0;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L869] 0 pthread_t t1217;
[L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L871] 0 pthread_t t1218;
[L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-2, t1218=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L873] 0 pthread_t t1219;
[L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-2, t1218=-1, t1219=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L875] 0 pthread_t t1220;
[L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-2, t1218=-1, t1219=0, t1220=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L752] 1 b$w_buff1 = b$w_buff0
[L753] 1 b$w_buff0 = 1
[L754] 1 b$w_buff1_used = b$w_buff0_used
[L755] 1 b$w_buff0_used = (_Bool)1
[L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used))
[L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0
[L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1
[L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2
[L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3
[L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4
[L762] 1 b$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L765] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L782] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L785] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b)
[L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used
[L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used
[L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2
[L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L797] 2 return 0;
[L802] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0]
[L805] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b)
[L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used
[L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used
[L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3
[L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L815] 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L817] 3 return 0;
[L822] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L825] 4 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L828] 4 __unbuffered_p3_EAX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L831] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L832] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L833] 4 b$flush_delayed = weak$$choice2
[L834] 4 b$mem_tmp = b
[L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1)
[L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0))
[L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1))
[L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used))
[L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4))
[L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L842] 4 __unbuffered_p3_EBX = b
[L843] 4 b = b$flush_delayed ? b$mem_tmp : b
[L844] 4 b$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b)
[L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used
[L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used
[L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4
[L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L856] 4 return 0;
[L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b)
[L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used
[L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used
[L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1
[L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-2, t1218=-1, t1219=0, t1220=1, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L880] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L880] RET 0 assume_abort_if_not(main$tmp_guard0)
[L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b)
[L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used
[L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used
[L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0
[L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-2, t1218=-1, t1219=0, t1220=1, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-2, t1218=-1, t1219=0, t1220=1, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L891] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
- UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 554.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 270.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: 38, 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.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 280.8s, ConditionalCommutativityCheckTime: 280.7s, ConditionalCommutativityIAIntegrations: 2, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 24, ConditionalCommutativityTraceChecks: 24, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-18 11:53:40,635 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 11:53:40,809 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