./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version b86fb0b7
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-18 21:28:05,832 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-18 21:28:05,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-18 21:28:05,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-18 21:28:05,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-18 21:28:05,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-18 21:28:05,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-18 21:28:05,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-18 21:28:05,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-18 21:28:05,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-18 21:28:05,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-18 21:28:05,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-18 21:28:05,903 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-18 21:28:05,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-18 21:28:05,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-18 21:28:05,904 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-18 21:28:05,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-18 21:28:05,904 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-18 21:28:05,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-18 21:28:05,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-18 21:28:05,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-18 21:28:05,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-18 21:28:05,906 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-18 21:28:05,906 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-18 21:28:05,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-18 21:28:05,906 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-18 21:28:05,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-18 21:28:05,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-18 21:28:05,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-18 21:28:05,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-18 21:28:05,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 21:28:05,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-18 21:28:05,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-18 21:28:05,908 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-18 21:28:05,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-18 21:28:05,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-18 21:28:05,909 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-18 21:28:05,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-18 21:28:05,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-18 21:28:05,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-18 21:28:05,910 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-18 21:28:05,910 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5
[2024-10-18 21:28:06,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-18 21:28:06,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-18 21:28:06,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-18 21:28:06,167 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-18 21:28:06,167 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-18 21:28:06,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i
[2024-10-18 21:28:07,378 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-18 21:28:07,660 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-18 21:28:07,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i
[2024-10-18 21:28:07,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/475665acf/bc8cee2f869b47fbbe54fc544618b8af/FLAGdcc7e77f2
[2024-10-18 21:28:07,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/475665acf/bc8cee2f869b47fbbe54fc544618b8af
[2024-10-18 21:28:07,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-18 21:28:07,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-18 21:28:07,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-18 21:28:07,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-18 21:28:07,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-18 21:28:07,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:28:07" (1/1) ...
[2024-10-18 21:28:07,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94de0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:07, skipping insertion in model container
[2024-10-18 21:28:07,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 09:28:07" (1/1) ...
[2024-10-18 21:28:08,001 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-18 21:28:08,316 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300]
[2024-10-18 21:28:08,350 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 21:28:08,359 INFO L200 MainTranslator]: Completed pre-run
[2024-10-18 21:28:08,398 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300]
[2024-10-18 21:28:08,417 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-18 21:28:08,458 INFO L204 MainTranslator]: Completed translation
[2024-10-18 21:28:08,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08 WrapperNode
[2024-10-18 21:28:08,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-18 21:28:08,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-18 21:28:08,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-18 21:28:08,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-18 21:28:08,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,513 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136
[2024-10-18 21:28:08,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-18 21:28:08,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-18 21:28:08,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-18 21:28:08,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-18 21:28:08,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-18 21:28:08,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-18 21:28:08,567 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-18 21:28:08,567 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-18 21:28:08,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (1/1) ...
[2024-10-18 21:28:08,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-18 21:28:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 21:28:08,604 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 21:28:08,606 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 21:28:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback
[2024-10-18 21:28:08,641 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback
[2024-10-18 21:28:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-18 21:28:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-10-18 21:28:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-10-18 21:28:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-18 21:28:08,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-10-18 21:28:08,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-10-18 21:28:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-10-18 21:28:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-10-18 21:28:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-18 21:28:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-10-18 21:28:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-18 21:28:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-18 21:28:08,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-18 21:28:08,648 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 21:28:08,826 INFO L238 CfgBuilder]: Building ICFG
[2024-10-18 21:28:08,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-18 21:28:09,039 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-18 21:28:09,040 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-18 21:28:09,156 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-18 21:28:09,156 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-18 21:28:09,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:28:09 BoogieIcfgContainer
[2024-10-18 21:28:09,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-18 21:28:09,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-18 21:28:09,160 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-18 21:28:09,162 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-18 21:28:09,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 09:28:07" (1/3) ...
[2024-10-18 21:28:09,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698774c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:28:09, skipping insertion in model container
[2024-10-18 21:28:09,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 09:28:08" (2/3) ...
[2024-10-18 21:28:09,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698774c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 09:28:09, skipping insertion in model container
[2024-10-18 21:28:09,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:28:09" (3/3) ...
[2024-10-18 21:28:09,164 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i
[2024-10-18 21:28:09,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-18 21:28:09,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-10-18 21:28:09,177 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-18 21:28:09,252 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-10-18 21:28:09,347 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-18 21:28:09,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-18 21:28:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-18 21:28:09,351 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 21:28:09,356 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 21:28:09,452 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-18 21:28:09,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:09,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-18 21:28:09,474 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;@714e623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-18 21:28:09,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-10-18 21:28:09,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2024-10-18 21:28:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2061936771, now seen corresponding path program 1 times
[2024-10-18 21:28:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 21:28:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826142821]
[2024-10-18 21:28:09,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 21:28:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 21:28:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 21:28:09,901 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 21:28:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 21:28:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826142821]
[2024-10-18 21:28:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826142821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 21:28:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 21:28:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-18 21:28:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427551181]
[2024-10-18 21:28:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 21:28:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-18 21:28:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 21:28:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-18 21:28:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-18 21:28:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:09,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 21:28:09,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 21:28:09,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-18 21:28:09,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2024-10-18 21:28:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1541266083, now seen corresponding path program 1 times
[2024-10-18 21:28:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 21:28:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364234784]
[2024-10-18 21:28:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 21:28:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 21:28:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 21:28:10,252 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 21:28:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 21:28:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364234784]
[2024-10-18 21:28:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364234784] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 21:28:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 21:28:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-18 21:28:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66841964]
[2024-10-18 21:28:10,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 21:28:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-18 21:28:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 21:28:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-18 21:28:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-18 21:28:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:10,257 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 21:28:10,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 21:28:10,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:10,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:11,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-18 21:28:11,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2024-10-18 21:28:11,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash -938907489, now seen corresponding path program 1 times
[2024-10-18 21:28:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 21:28:11,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452104625]
[2024-10-18 21:28:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 21:28:11,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 21:28:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 21:28:12,082 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 21:28:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 21:28:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452104625]
[2024-10-18 21:28:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452104625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 21:28:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 21:28:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-18 21:28:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133471214]
[2024-10-18 21:28:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 21:28:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-18 21:28:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 21:28:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-18 21:28:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-18 21:28:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:12,084 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 21:28:12,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 21:28:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-18 21:28:12,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2024-10-18 21:28:12,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash 958639348, now seen corresponding path program 1 times
[2024-10-18 21:28:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 21:28:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148858086]
[2024-10-18 21:28:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 21:28:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 21:28:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-18 21:28:12,363 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 21:28:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-18 21:28:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148858086]
[2024-10-18 21:28:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148858086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-18 21:28:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-18 21:28:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-18 21:28:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985007667]
[2024-10-18 21:28:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-18 21:28:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-18 21:28:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-18 21:28:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-18 21:28:12,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-18 21:28:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:12,369 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-18 21:28:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 21:28:12,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-18 21:28:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-18 21:28:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-18 21:28:12,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-18 21:28:12,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2024-10-18 21:28:12,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-18 21:28:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1975511500, now seen corresponding path program 1 times
[2024-10-18 21:28:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-18 21:28:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995985734]
[2024-10-18 21:28:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-18 21:28:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-18 21:28:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 21:28:12,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-18 21:28:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-18 21:28:12,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-18 21:28:12,564 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-18 21:28:12,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining)
[2024-10-18 21:28:12,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining)
[2024-10-18 21:28:12,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining)
[2024-10-18 21:28:12,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining)
[2024-10-18 21:28:12,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining)
[2024-10-18 21:28:12,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining)
[2024-10-18 21:28:12,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2024-10-18 21:28:12,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining)
[2024-10-18 21:28:12,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-18 21:28:12,575 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-10-18 21:28:12,626 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-18 21:28:12,626 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-18 21:28:12,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.10 09:28:12 BasicIcfg
[2024-10-18 21:28:12,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-18 21:28:12,629 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-18 21:28:12,629 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-18 21:28:12,629 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-18 21:28:12,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 09:28:09" (3/4) ...
[2024-10-18 21:28:12,630 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-18 21:28:12,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-18 21:28:12,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-18 21:28:12,684 INFO L158 Benchmark]: Toolchain (without parser) took 4731.74ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 131.6MB in the beginning and 141.0MB in the end (delta: -9.5MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,684 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 21:28:12,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.35ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 94.4MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.04ms. Allocated memory is still 165.7MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,684 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 165.7MB. Free memory was 92.3MB in the beginning and 89.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,685 INFO L158 Benchmark]: RCFGBuilder took 590.29ms. Allocated memory is still 165.7MB. Free memory was 89.1MB in the beginning and 46.1MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,685 INFO L158 Benchmark]: TraceAbstraction took 3469.84ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 45.1MB in the beginning and 151.5MB in the end (delta: -106.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-18 21:28:12,685 INFO L158 Benchmark]: Witness Printer took 54.05ms. Allocated memory is still 257.9MB. Free memory was 151.5MB in the beginning and 141.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-18 21:28:12,686 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.14ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 505.35ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 94.4MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 56.04ms. Allocated memory is still 165.7MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 46.90ms. Allocated memory is still 165.7MB. Free memory was 92.3MB in the beginning and 89.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 590.29ms. Allocated memory is still 165.7MB. Free memory was 89.1MB in the beginning and 46.1MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 3469.84ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 45.1MB in the beginning and 151.5MB in the end (delta: -106.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 54.05ms. Allocated memory is still 257.9MB. Free memory was 151.5MB in the beginning and 141.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 528, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 43, dependent conditional: 31, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 401, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 401, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1492, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 1193, dependent conditional: 0, dependent unconditional: 1193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 509, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 401, unknown conditional: 0, unknown unconditional: 401] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 401, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 401, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1492, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 1193, dependent conditional: 0, dependent unconditional: 1193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 509, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 401, unknown conditional: 0, unknown unconditional: 401] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48 ], Independence queries for same thread: 31, Persistent sets #1 benchmarks: Persistent set computation time: 1.5s, Number of persistent set computation: 51, Number of trivial persistent sets: 51, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 401, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 528, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 43, dependent conditional: 31, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 497, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 401, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 401, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1492, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 1193, dependent conditional: 0, dependent unconditional: 1193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 509, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 401, unknown conditional: 0, unknown unconditional: 401] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 48, independent unconditional: 437, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 509, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 401, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 401, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1492, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 1193, dependent conditional: 0, dependent unconditional: 1193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 509, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 401, unknown conditional: 0, unknown unconditional: 401] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48 ], Independence queries for same thread: 31
- CounterExampleResult [Line: 3887]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L3888] 0 pthread_t t1,t2;
[L3962] CALL, EXPR 0 my_drv_init()
[L3956] 0 return 0;
[L3962] RET, EXPR 0 my_drv_init()
[L3962] 0 int ret = my_drv_init();
[L3963] COND TRUE 0 ret==0
[L3964] 0 int probe_ret;
[L3965] 0 struct my_data data;
[L3966] CALL, EXPR 0 my_drv_probe(&data)
[L3919] 0 struct device *d = &data->dev;
[L3923] 0 data->shared.a = 0
[L3924] 0 data->shared.b = 0
[L3925] 0 int res = __VERIFIER_nondet_int();
[L3926] COND FALSE 0 !(\read(res))
[L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d)
VAL [\old(arg)={6:24}, \old(data)={6:0}, d={6:24}, data={6:0}, res=0, t1=-2, t2=0]
[L3902] 1 struct device *dev = (struct device*)arg;
[L3903] 1 struct my_data *data;
[L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
[L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}
[L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );})
[L3907] 1 data->shared.a = 1
VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-2, t2=0]
[L3910] EXPR 1 data->shared.b
[L3910] 1 int lb = data->shared.b;
[L3913] 1 data->shared.b = lb + 1
VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-2, t2=0]
[L3916] 1 return 0;
[L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d)
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-2, t2=-1]
[L3902] 2 struct device *dev = (struct device*)arg;
[L3903] 2 struct my_data *data;
[L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
[L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}
[L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );})
[L3907] 2 data->shared.a = 1
VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-2, t2=-1]
[L3910] EXPR 2 data->shared.b
[L3910] 2 int lb = data->shared.b;
[L3913] 2 data->shared.b = lb + 1
VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-2, t2=-1]
[L3916] 2 return 0;
[L3931] 0 return 0;
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result=0, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-2, t2=-1]
[L3966] RET, EXPR 0 my_drv_probe(&data)
[L3966] 0 probe_ret = my_drv_probe(&data)
[L3967] COND TRUE 0 probe_ret==0
[L3968] CALL 0 my_drv_disconnect(&data)
[L3937] 0 void *status;
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-2, t2=-1]
[L3938] FCALL, JOIN 1 pthread_join(t1, &status)
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-2, t2=-1]
[L3941] 0 data->shared.a = 3
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-2, t2=-1]
[L3944] 0 data->shared.b = 3
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-2, t2=-1]
[L3947] EXPR 0 data->shared.a
[L3947] CALL 0 ldv_assert(data->shared.a==3)
[L3887] COND FALSE 0 !(!expression)
[L3947] RET 0 ldv_assert(data->shared.a==3)
[L3950] EXPR 0 data->shared.b
[L3950] CALL 0 ldv_assert(data->shared.b==3)
[L3887] COND FALSE 0 !(!expression)
[L3950] RET 0 ldv_assert(data->shared.b==3)
[L3952] FCALL, JOIN 2 pthread_join(t2, &status)
VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-2, t2=-1]
[L3968] RET 0 my_drv_disconnect(&data)
[L3969] EXPR 0 data.shared.a
[L3969] CALL 0 ldv_assert(data.shared.a==1)
[L3887] COND TRUE 0 !expression
VAL [\old(arg)={6:24}, \old(expression)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-2, t2=-1]
[L3887] 0 reach_error()
VAL [\old(arg)={6:24}, \old(expression)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-2, t2=-1]
- UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 3930]: 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: 3929]: 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 4 procedures, 67 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-18 21:28:12,709 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 21:28:12,908 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