/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -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-9d61ce8-m [2023-09-06 18:32:26,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-06 18:32:26,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-06 18:32:26,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-06 18:32:26,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-06 18:32:26,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-06 18:32:26,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-06 18:32:26,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-06 18:32:26,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-06 18:32:26,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-06 18:32:26,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-06 18:32:26,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-06 18:32:26,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-06 18:32:26,746 INFO L153 SettingsManager]: * Use SBE=true [2023-09-06 18:32:26,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-06 18:32:26,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-06 18:32:26,746 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-06 18:32:26,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-06 18:32:26,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-06 18:32:26,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-06 18:32:26,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-06 18:32:26,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-06 18:32:26,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-06 18:32:26,748 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-06 18:32:26,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-06 18:32:26,748 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-06 18:32:26,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-06 18:32:26,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-06 18:32:26,749 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-06 18:32:26,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-06 18:32:26,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 18:32:26,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-06 18:32:26,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-06 18:32:26,752 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-06 18:32:26,752 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-06 18:32:26,752 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 [2023-09-06 18:32:26,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-06 18:32:26,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-06 18:32:26,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-06 18:32:26,989 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-06 18:32:26,989 INFO L274 PluginConnector]: CDTParser initialized [2023-09-06 18:32:26,991 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-06 18:32:28,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-06 18:32:28,475 INFO L384 CDTParser]: Found 1 translation units. [2023-09-06 18:32:28,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-09-06 18:32:28,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e293491f2/a6e8b03ec99b474fbfecb9f483e797e9/FLAGe06478ba8 [2023-09-06 18:32:28,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e293491f2/a6e8b03ec99b474fbfecb9f483e797e9 [2023-09-06 18:32:28,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-06 18:32:28,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-06 18:32:28,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-06 18:32:28,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-06 18:32:28,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-06 18:32:28,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 06:32:28" (1/1) ... [2023-09-06 18:32:28,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127eeb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:28, skipping insertion in model container [2023-09-06 18:32:28,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 06:32:28" (1/1) ... [2023-09-06 18:32:28,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-06 18:32:28,732 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-06 18:32:29,108 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-06 18:32:29,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 18:32:29,149 INFO L202 MainTranslator]: Completed pre-run [2023-09-06 18:32:29,159 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-06 18:32:29,163 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-09-06 18:32:29,165 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-09-06 18:32:29,172 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [735] [2023-09-06 18:32:29,192 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-06 18:32:29,203 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [1691] [2023-09-06 18:32:29,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 18:32:29,312 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 18:32:29,312 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 18:32:29,313 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 18:32:29,319 INFO L206 MainTranslator]: Completed translation [2023-09-06 18:32:29,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29 WrapperNode [2023-09-06 18:32:29,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-06 18:32:29,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-06 18:32:29,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-06 18:32:29,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-06 18:32:29,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,405 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-09-06 18:32:29,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-06 18:32:29,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-06 18:32:29,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-06 18:32:29,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-06 18:32:29,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-06 18:32:29,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-06 18:32:29,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-06 18:32:29,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-06 18:32:29,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (1/1) ... [2023-09-06 18:32:29,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 18:32:29,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 18:32:29,514 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-06 18:32:29,536 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-06 18:32:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-06 18:32:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-06 18:32:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-06 18:32:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-09-06 18:32:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-09-06 18:32:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-06 18:32:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-06 18:32:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-06 18:32:29,559 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-06 18:32:29,832 INFO L236 CfgBuilder]: Building ICFG [2023-09-06 18:32:29,834 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-06 18:32:30,151 INFO L277 CfgBuilder]: Performing block encoding [2023-09-06 18:32:30,200 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-06 18:32:30,200 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-06 18:32:30,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 06:32:30 BoogieIcfgContainer [2023-09-06 18:32:30,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-06 18:32:30,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-06 18:32:30,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-06 18:32:30,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-06 18:32:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.09 06:32:28" (1/3) ... [2023-09-06 18:32:30,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c848bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 06:32:30, skipping insertion in model container [2023-09-06 18:32:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 06:32:29" (2/3) ... [2023-09-06 18:32:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c848bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 06:32:30, skipping insertion in model container [2023-09-06 18:32:30,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 06:32:30" (3/3) ... [2023-09-06 18:32:30,211 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2023-09-06 18:32:30,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-06 18:32:30,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-06 18:32:30,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-09-06 18:32:30,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-06 18:32:30,302 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-06 18:32:30,343 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 18:32:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-06 18:32:30,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 18:32:30,346 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-06 18:32:30,348 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-06 18:32:30,387 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-06 18:32:30,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-06 18:32:30,398 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;@294e2179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 18:32:30,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-09-06 18:32:30,420 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-06 18:32:30,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1530600545, now seen corresponding path program 1 times [2023-09-06 18:32:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325329089] [2023-09-06 18:32:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:30,979 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-06 18:32:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325329089] [2023-09-06 18:32:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325329089] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-06 18:32:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997939401] [2023-09-06 18:32:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:30,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-06 18:32:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-06 18:32:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-06 18:32:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:31,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:31,014 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-06 18:32:31,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-06 18:32:31,108 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-06 18:32:31,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -830929054, now seen corresponding path program 1 times [2023-09-06 18:32:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112418169] [2023-09-06 18:32:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:31,539 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-06 18:32:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112418169] [2023-09-06 18:32:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112418169] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:31,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-06 18:32:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96038979] [2023-09-06 18:32:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:31,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-06 18:32:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-06 18:32:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-06 18:32:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:31,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:31,545 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-06 18:32:31,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:31,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:31,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-06 18:32:31,661 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-06 18:32:31,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1649069099, now seen corresponding path program 1 times [2023-09-06 18:32:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:31,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513081158] [2023-09-06 18:32:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:31,967 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-06 18:32:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513081158] [2023-09-06 18:32:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513081158] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:31,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-06 18:32:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985896610] [2023-09-06 18:32:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:31,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-06 18:32:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-06 18:32:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-06 18:32:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:31,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:31,970 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-06 18:32:31,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:31,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:31,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:32,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-06 18:32:32,135 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-06 18:32:32,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1172056113, now seen corresponding path program 1 times [2023-09-06 18:32:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985433544] [2023-09-06 18:32:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:32,398 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-06 18:32:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985433544] [2023-09-06 18:32:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985433544] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-06 18:32:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969750115] [2023-09-06 18:32:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-06 18:32:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-06 18:32:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-06 18:32:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:32,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:32,411 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-06 18:32:32,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:32,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:32,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:32,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:32,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-06 18:32:32,504 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-06 18:32:32,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1974001511, now seen corresponding path program 1 times [2023-09-06 18:32:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:32,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253204455] [2023-09-06 18:32:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:32,658 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-06 18:32:32,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253204455] [2023-09-06 18:32:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253204455] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-06 18:32:32,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89316158] [2023-09-06 18:32:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:32,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-06 18:32:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-06 18:32:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-06 18:32:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:32,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:32,661 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-06 18:32:32,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:32,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:32,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-06 18:32:32,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:32,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-06 18:32:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:32,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-06 18:32:32,806 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-06 18:32:32,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -247133323, now seen corresponding path program 1 times [2023-09-06 18:32:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328126311] [2023-09-06 18:32:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 18:32:34,391 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-06 18:32:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 18:32:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328126311] [2023-09-06 18:32:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328126311] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 18:32:34,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 18:32:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-09-06 18:32:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009115232] [2023-09-06 18:32:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 18:32:34,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-06 18:32:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 18:32:34,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-06 18:32:34,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2023-09-06 18:32:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:34,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 18:32:34,395 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-06 18:32:34,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:34,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-06 18:32:34,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:34,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:34,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:34,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 18:32:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-06 18:32:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-06 18:32:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 18:32:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 18:32:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-06 18:32:35,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-06 18:32:35,650 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-06 18:32:35,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 18:32:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1691780073, now seen corresponding path program 1 times [2023-09-06 18:32:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 18:32:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60655949] [2023-09-06 18:32:35,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 18:32:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 18:32:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-06 18:32:35,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-06 18:32:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-06 18:32:35,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-06 18:32:35,868 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-06 18:32:35,869 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-09-06 18:32:35,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-09-06 18:32:35,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-09-06 18:32:35,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-09-06 18:32:35,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-09-06 18:32:35,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-09-06 18:32:35,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-09-06 18:32:35,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-09-06 18:32:35,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-06 18:32:35,874 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-09-06 18:32:35,877 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-06 18:32:35,878 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-06 18:32:35,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.09 06:32:35 BasicIcfg [2023-09-06 18:32:35,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-06 18:32:35,986 INFO L158 Benchmark]: Toolchain (without parser) took 7459.00ms. Allocated memory was 299.9MB in the beginning and 488.6MB in the end (delta: 188.7MB). Free memory was 253.3MB in the beginning and 224.1MB in the end (delta: 29.1MB). Peak memory consumption was 218.9MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,986 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 166.7MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-06 18:32:35,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.89ms. Allocated memory is still 299.9MB. Free memory was 253.3MB in the beginning and 198.2MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.94ms. Allocated memory is still 299.9MB. Free memory was 198.2MB in the beginning and 194.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,987 INFO L158 Benchmark]: Boogie Preprocessor took 76.05ms. Allocated memory is still 299.9MB. Free memory was 194.5MB in the beginning and 191.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,987 INFO L158 Benchmark]: RCFGBuilder took 720.33ms. Allocated memory is still 299.9MB. Free memory was 191.9MB in the beginning and 255.2MB in the end (delta: -63.3MB). Peak memory consumption was 25.9MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,987 INFO L158 Benchmark]: TraceAbstraction took 5777.34ms. Allocated memory was 299.9MB in the beginning and 488.6MB in the end (delta: 188.7MB). Free memory was 254.2MB in the beginning and 224.1MB in the end (delta: 30.0MB). Peak memory consumption was 219.3MB. Max. memory is 7.0GB. [2023-09-06 18:32:35,989 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.13ms. Allocated memory is still 166.7MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 793.89ms. Allocated memory is still 299.9MB. Free memory was 253.3MB in the beginning and 198.2MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 84.94ms. Allocated memory is still 299.9MB. Free memory was 198.2MB in the beginning and 194.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 7.0GB. * Boogie Preprocessor took 76.05ms. Allocated memory is still 299.9MB. Free memory was 194.5MB in the beginning and 191.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 720.33ms. Allocated memory is still 299.9MB. Free memory was 191.9MB in the beginning and 255.2MB in the end (delta: -63.3MB). Peak memory consumption was 25.9MB. Max. memory is 7.0GB. * TraceAbstraction took 5777.34ms. Allocated memory was 299.9MB in the beginning and 488.6MB in the end (delta: 188.7MB). Free memory was 254.2MB in the beginning and 224.1MB in the end (delta: 30.0MB). Peak memory consumption was 219.3MB. 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.5s, OverallIterations: 7, 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: 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-06 18:32:36,012 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-06 18:32:36,213 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...