/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 22:39:08,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 22:39:08,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-07 22:39:08,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 22:39:08,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 22:39:08,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 22:39:08,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 22:39:08,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 22:39:08,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 22:39:08,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 22:39:08,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 22:39:08,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 22:39:08,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 22:39:08,675 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 22:39:08,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 22:39:08,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 22:39:08,676 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 22:39:08,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 22:39:08,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 22:39:08,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 22:39:08,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 22:39:08,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 22:39:08,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 22:39:08,678 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 22:39:08,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 22:39:08,679 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 22:39:08,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 22:39:08,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 22:39:08,680 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 22:39:08,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 22:39:08,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 22:39:08,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 22:39:08,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 22:39:08,681 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-07 22:39:08,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 22:39:08,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 22:39:08,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 22:39:08,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 22:39:08,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 22:39:08,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 22:39:08,682 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-07 22:39:08,682 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/UAutomizer-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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR [2023-09-07 22:39:08,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 22:39:08,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 22:39:08,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 22:39:08,923 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 22:39:08,923 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 22:39:08,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-09-07 22:39:10,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 22:39:10,376 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 22:39:10,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-09-07 22:39:10,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ba99147/8e806c2b03d847e889d591f77749deb6/FLAGa03dceb8a [2023-09-07 22:39:10,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ba99147/8e806c2b03d847e889d591f77749deb6 [2023-09-07 22:39:10,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 22:39:10,429 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 22:39:10,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 22:39:10,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 22:39:10,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 22:39:10,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:39:10" (1/1) ... [2023-09-07 22:39:10,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184e608f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:10, skipping insertion in model container [2023-09-07 22:39:10,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:39:10" (1/1) ... [2023-09-07 22:39:10,494 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 22:39:10,609 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-07 22:39:11,006 WARN L240 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_4-container_of.i[75002,75015] [2023-09-07 22:39:11,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 22:39:11,050 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 22:39:11,059 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-07 22:39:11,063 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-09-07 22:39:11,065 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-09-07 22:39:11,071 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [735] [2023-09-07 22:39:11,083 WARN L240 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_4-container_of.i[75002,75015] [2023-09-07 22:39:11,085 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [1691] [2023-09-07 22:39:11,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 22:39:11,193 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 22:39:11,193 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 22:39:11,193 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 22:39:11,199 INFO L206 MainTranslator]: Completed translation [2023-09-07 22:39:11,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11 WrapperNode [2023-09-07 22:39:11,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 22:39:11,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 22:39:11,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 22:39:11,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 22:39:11,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,249 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-09-07 22:39:11,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 22:39:11,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 22:39:11,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 22:39:11,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 22:39:11,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 22:39:11,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 22:39:11,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 22:39:11,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 22:39:11,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (1/1) ... [2023-09-07 22:39:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 22:39:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 22:39:11,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-07 22:39:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-07 22:39:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 22:39:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 22:39:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 22:39:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 22:39:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 22:39:11,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-09-07 22:39:11,343 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 22:39:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 22:39:11,344 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 22:39:11,606 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 22:39:11,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 22:39:11,876 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 22:39:11,917 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 22:39:11,917 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-07 22:39:11,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:39:11 BoogieIcfgContainer [2023-09-07 22:39:11,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 22:39:11,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 22:39:11,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 22:39:11,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 22:39:11,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:39:10" (1/3) ... [2023-09-07 22:39:11,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142412ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:39:11, skipping insertion in model container [2023-09-07 22:39:11,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:11" (2/3) ... [2023-09-07 22:39:11,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142412ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:39:11, skipping insertion in model container [2023-09-07 22:39:11,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:39:11" (3/3) ... [2023-09-07 22:39:11,928 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2023-09-07 22:39:11,934 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 22:39:11,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 22:39:11,942 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-09-07 22:39:11,942 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 22:39:12,004 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 22:39:12,047 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 22:39:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 22:39:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 22:39:12,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 22:39:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 22:39:12,107 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 22:39:12,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-07 22:39:12,120 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4cb4655c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 22:39:12,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-09-07 22:39:12,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:12,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1530600545, now seen corresponding path program 1 times [2023-09-07 22:39:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092400948] [2023-09-07 22:39:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092400948] [2023-09-07 22:39:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092400948] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-07 22:39:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555606536] [2023-09-07 22:39:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:12,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-07 22:39:12,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-07 22:39:12,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-07 22:39:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:12,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:12,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2023-09-07 22:39:12,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:12,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 22:39:12,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:12,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -830929054, now seen corresponding path program 1 times [2023-09-07 22:39:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898695565] [2023-09-07 22:39:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898695565] [2023-09-07 22:39:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898695565] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:13,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:13,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-07 22:39:13,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288266348] [2023-09-07 22:39:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:13,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 22:39:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:13,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 22:39:13,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-07 22:39:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:13,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:13,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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) [2023-09-07 22:39:13,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:13,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 22:39:13,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:13,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1649069099, now seen corresponding path program 1 times [2023-09-07 22:39:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524747627] [2023-09-07 22:39:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524747627] [2023-09-07 22:39:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524747627] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-07 22:39:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485553249] [2023-09-07 22:39:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 22:39:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 22:39:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-07 22:39:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:13,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2023-09-07 22:39:13,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:13,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:13,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-07 22:39:13,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:13,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1172056113, now seen corresponding path program 1 times [2023-09-07 22:39:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686207245] [2023-09-07 22:39:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686207245] [2023-09-07 22:39:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686207245] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 22:39:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564333997] [2023-09-07 22:39:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:14,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-07 22:39:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:14,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-07 22:39:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-07 22:39:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:14,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:14,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-09-07 22:39:14,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:14,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:14,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:14,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-07 22:39:14,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:14,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1974001511, now seen corresponding path program 1 times [2023-09-07 22:39:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046390519] [2023-09-07 22:39:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046390519] [2023-09-07 22:39:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046390519] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:14,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 22:39:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298712804] [2023-09-07 22:39:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-07 22:39:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-07 22:39:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-07 22:39:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:14,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-09-07 22:39:14,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:14,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:14,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 22:39:14,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:14,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 22:39:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:14,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-07 22:39:14,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:14,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -247133323, now seen corresponding path program 1 times [2023-09-07 22:39:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220260699] [2023-09-07 22:39:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 22:39:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 22:39:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 22:39:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220260699] [2023-09-07 22:39:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220260699] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 22:39:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 22:39:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-09-07 22:39:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473078893] [2023-09-07 22:39:16,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 22:39:16,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-07 22:39:16,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 22:39:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-07 22:39:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2023-09-07 22:39:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:16,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 22:39:16,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 20 states have internal predecessors, (114), 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) [2023-09-07 22:39:16,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:16,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 22:39:16,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:16,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:16,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:16,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 22:39:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 22:39:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 22:39:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 22:39:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 22:39:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-07 22:39:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-07 22:39:17,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-07 22:39:17,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 22:39:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1691780073, now seen corresponding path program 1 times [2023-09-07 22:39:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 22:39:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101641770] [2023-09-07 22:39:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 22:39:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 22:39:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 22:39:17,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-07 22:39:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 22:39:17,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-07 22:39:17,477 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-07 22:39:17,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-09-07 22:39:17,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-09-07 22:39:17,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-09-07 22:39:17,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-07 22:39:17,485 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-09-07 22:39:17,489 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 22:39:17,489 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 22:39:17,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 10:39:17 BasicIcfg [2023-09-07 22:39:17,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 22:39:17,621 INFO L158 Benchmark]: Toolchain (without parser) took 7192.61ms. Allocated memory was 232.8MB in the beginning and 368.1MB in the end (delta: 135.3MB). Free memory was 179.3MB in the beginning and 303.5MB in the end (delta: -124.2MB). Peak memory consumption was 214.0MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,621 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 164.6MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 22:39:17,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.43ms. Allocated memory is still 232.8MB. Free memory was 178.9MB in the beginning and 181.8MB in the end (delta: -2.9MB). Peak memory consumption was 49.9MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 232.8MB. Free memory was 181.8MB in the beginning and 178.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,622 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 232.8MB. Free memory was 178.2MB in the beginning and 175.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,623 INFO L158 Benchmark]: RCFGBuilder took 634.30ms. Allocated memory is still 232.8MB. Free memory was 175.5MB in the beginning and 147.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,623 INFO L158 Benchmark]: TraceAbstraction took 5698.68ms. Allocated memory was 232.8MB in the beginning and 368.1MB in the end (delta: 135.3MB). Free memory was 146.7MB in the beginning and 303.5MB in the end (delta: -156.8MB). Peak memory consumption was 179.8MB. Max. memory is 7.0GB. [2023-09-07 22:39:17,631 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.11ms. Allocated memory is still 164.6MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 768.43ms. Allocated memory is still 232.8MB. Free memory was 178.9MB in the beginning and 181.8MB in the end (delta: -2.9MB). Peak memory consumption was 49.9MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 232.8MB. Free memory was 181.8MB in the beginning and 178.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 7.0GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 232.8MB. Free memory was 178.2MB in the beginning and 175.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 634.30ms. Allocated memory is still 232.8MB. Free memory was 175.5MB in the beginning and 147.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 7.0GB. * TraceAbstraction took 5698.68ms. Allocated memory was 232.8MB in the beginning and 368.1MB in the end (delta: 135.3MB). Free memory was 146.7MB in the beginning and 303.5MB in the end (delta: -156.8MB). Peak memory consumption was 179.8MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 735]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [735] - GenericResultAtLocation [Line: 1691]: Unsoundness Warning unspecified type, defaulting to int C: unsigned long [1691] - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 21 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 21 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); VAL [my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1746] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1747] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1748] 0 struct my_data data; VAL [data={7:0}, ret=0, t1={3:0}, t2={4:0}] [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; VAL [d={7:24}, data={7:0}, data={7:0}, t1={3:0}, t2={4:0}] [L1708] 0 data->shared.a = 0 VAL [d={7:24}, data={7:0}, data={7:0}, t1={3:0}, t2={4:0}] [L1709] 0 data->shared.b = 0 VAL [d={7:24}, data={7:0}, data={7:0}, t1={3:0}, t2={4:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, d={7:24}, data={7:0}, data={7:0}, res=0, t1={3:0}, t2={4:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [d={7:24}, data={7:0}, data={7:0}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, d={7:24}, data={7:0}, data={7:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-2, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, d={7:24}, data={7:0}, data={7:0}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-1, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, arg={7:24}, d={7:24}, data={7:0}, data={7:0}, res=0, t1={3:0}, t2={4:0}] [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) VAL [arg={7:24}, data={7:0}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [arg={7:24}, data={7:0}, data={7:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1723] 0 data->shared.a = 3 VAL [arg={7:24}, data={7:0}, data={7:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1726] 0 data->shared.b = 3 VAL [arg={7:24}, data={7:0}, data={7:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1729] EXPR 0 data->shared.a [L1729] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND FALSE 0 !(!expression) [L1729] RET 0 ldv_assert(data->shared.a==3) [L1732] EXPR 0 data->shared.b [L1732] CALL 0 ldv_assert(data->shared.b==3) [L1675] COND FALSE 0 !(!expression) [L1732] RET 0 ldv_assert(data->shared.b==3) [L1734] 0 \read(t1) VAL [\read(t1)=-2, arg={7:24}, data={7:0}, data={7:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={7:24}, arg={7:24}, dev={7:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={7:24}, arg={7:24}, dev={7:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, dev={7:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, dev={7:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={7:24}, arg={7:24}, dev={7:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1703] 1 return 0; VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1734] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-2, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, data={7:0}, data={7:0}, dev={7:24}, lb=3, pthread_join(t1, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1735] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, data={7:0}, data={7:0}, dev={7:24}, lb=3, status={6:0}, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1697] EXPR 2 data->shared.b [L1697] 2 int lb = data->shared.b; [L1700] 2 data->shared.b = lb + 1 VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1703] 2 return 0; VAL [\result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=3, t1={3:0}, t2={4:0}] [L1735] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=-1, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, data={7:0}, data={7:0}, dev={7:24}, lb=3, pthread_join(t2, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1751] RET 0 my_drv_disconnect(&data) [L1752] EXPR 0 data.shared.a VAL [\result={0:0}, arg={7:24}, arg={7:24}, data.shared.a=1, data={7:0}, data={7:0}, dev={7:24}, lb=3, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1752] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, expression=1, lb=3, t1={3:0}, t2={4:0}] [L1752] RET 0 ldv_assert(data.shared.a==1) [L1753] EXPR 0 data.shared.b VAL [\result={0:0}, arg={7:24}, arg={7:24}, data.shared.b=5, data={7:0}, data={7:0}, dev={7:24}, lb=3, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1753] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, expression=0, lb=3, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, expression=0, lb=3, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 180 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.8s, 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: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2023-09-07 22:39:17,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-07 22:39:17,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...