/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 16:08:13,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 16:08:13,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 16:08:13,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 16:08:13,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 16:08:13,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 16:08:13,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 16:08:13,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 16:08:13,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 16:08:13,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 16:08:13,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 16:08:13,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 16:08:13,132 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 16:08:13,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 16:08:13,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 16:08:13,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 16:08:13,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 16:08:13,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 16:08:13,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 16:08:13,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 16:08:13,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 16:08:13,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 16:08:13,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 16:08:13,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 16:08:13,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 16:08:13,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 16:08:13,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 16:08:13,141 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 16:08:13,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 16:08:13,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:08:13,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 16:08:13,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 16:08:13,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 16:08:13,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 16:08:13,143 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 16:08:13,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 16:08:13,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 16:08:13,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 16:08:13,144 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 16:08:13,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 16:08:13,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 16:08:13,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 16:08:13,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 16:08:13,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 16:08:13,383 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 16:08:13,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2024-05-06 16:08:14,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 16:08:14,791 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 16:08:14,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2024-05-06 16:08:14,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d47da592/12840b796cc647de9afc11d062b828f0/FLAG9d57f1f6d [2024-05-06 16:08:14,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d47da592/12840b796cc647de9afc11d062b828f0 [2024-05-06 16:08:14,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 16:08:14,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 16:08:14,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 16:08:14,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 16:08:14,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 16:08:14,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:08:14" (1/1) ... [2024-05-06 16:08:14,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b7e44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:14, skipping insertion in model container [2024-05-06 16:08:14,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:08:14" (1/1) ... [2024-05-06 16:08:14,875 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 16:08:15,266 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] [2024-05-06 16:08:15,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:08:15,306 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 16:08:15,397 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] [2024-05-06 16:08:15,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:08:15,472 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 16:08:15,472 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 16:08:15,477 INFO L206 MainTranslator]: Completed translation [2024-05-06 16:08:15,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15 WrapperNode [2024-05-06 16:08:15,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 16:08:15,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 16:08:15,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 16:08:15,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 16:08:15,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,531 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2024-05-06 16:08:15,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 16:08:15,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 16:08:15,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 16:08:15,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 16:08:15,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 16:08:15,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 16:08:15,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 16:08:15,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 16:08:15,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (1/1) ... [2024-05-06 16:08:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:08:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:08:15,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 16:08:15,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 16:08:15,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 16:08:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-06 16:08:15,626 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-06 16:08:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 16:08:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-06 16:08:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 16:08:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 16:08:15,628 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 16:08:15,805 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 16:08:15,806 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 16:08:16,044 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 16:08:16,079 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 16:08:16,079 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 16:08:16,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:08:16 BoogieIcfgContainer [2024-05-06 16:08:16,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 16:08:16,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 16:08:16,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 16:08:16,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 16:08:16,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 04:08:14" (1/3) ... [2024-05-06 16:08:16,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f05de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:08:16, skipping insertion in model container [2024-05-06 16:08:16,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:08:15" (2/3) ... [2024-05-06 16:08:16,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f05de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:08:16, skipping insertion in model container [2024-05-06 16:08:16,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:08:16" (3/3) ... [2024-05-06 16:08:16,099 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-05-06 16:08:16,105 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 16:08:16,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 16:08:16,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-05-06 16:08:16,112 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 16:08:16,156 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 16:08:16,201 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 16:08:16,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 16:08:16,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:08:16,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 16:08:16,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 16:08:16,251 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 16:08:16,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:16,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 16:08:16,279 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c7fea8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 16:08:16,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-06 16:08:16,314 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)] === [2024-05-06 16:08:16,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:16,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1817902648, now seen corresponding path program 1 times [2024-05-06 16:08:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862851125] [2024-05-06 16:08:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:08:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:08:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:08:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862851125] [2024-05-06 16:08:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862851125] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:08:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:08:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 16:08:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363588735] [2024-05-06 16:08:16,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:08:16,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 16:08:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:08:16,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 16:08:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 16:08:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:16,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:08:16,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 16:08:16,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:16,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 16:08:16,944 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)] === [2024-05-06 16:08:16,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 897582124, now seen corresponding path program 1 times [2024-05-06 16:08:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358047352] [2024-05-06 16:08:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:08:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:08:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:08:17,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358047352] [2024-05-06 16:08:17,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358047352] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:08:17,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:08:17,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 16:08:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028685081] [2024-05-06 16:08:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:08:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 16:08:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:08:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 16:08:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 16:08:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:17,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:08:17,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 16:08:17,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 16:08:17,322 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)] === [2024-05-06 16:08:17,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 270946499, now seen corresponding path program 1 times [2024-05-06 16:08:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865441511] [2024-05-06 16:08:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:08:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:08:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:08:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865441511] [2024-05-06 16:08:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865441511] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:08:17,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:08:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 16:08:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953324216] [2024-05-06 16:08:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:08:17,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 16:08:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:08:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 16:08:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 16:08:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:17,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:08:17,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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) [2024-05-06 16:08:17,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:08:17,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-06 16:08:17,877 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)] === [2024-05-06 16:08:17,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -440538678, now seen corresponding path program 1 times [2024-05-06 16:08:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910920619] [2024-05-06 16:08:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:08:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:08:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:08:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910920619] [2024-05-06 16:08:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910920619] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:08:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:08:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 16:08:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123363177] [2024-05-06 16:08:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:08:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 16:08:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:08:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 16:08:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 16:08:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:18,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:08:18,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 16:08:18,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:08:18,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:08:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 16:08:18,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-06 16:08:18,230 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)] === [2024-05-06 16:08:18,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -771796698, now seen corresponding path program 1 times [2024-05-06 16:08:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729436932] [2024-05-06 16:08:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:08:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:08:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:08:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729436932] [2024-05-06 16:08:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729436932] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:08:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:08:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 16:08:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188664621] [2024-05-06 16:08:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:08:18,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 16:08:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:08:18,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 16:08:18,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 16:08:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:18,391 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:08:18,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 16:08:18,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:08:18,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 16:08:18,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 16:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 16:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 16:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 16:08:18,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-06 16:08:18,482 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)] === [2024-05-06 16:08:18,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:08:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1547343235, now seen corresponding path program 1 times [2024-05-06 16:08:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:08:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087359876] [2024-05-06 16:08:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:08:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:08:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:08:18,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:08:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:08:18,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 16:08:18,655 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 16:08:18,656 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-05-06 16:08:18,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-06 16:08:18,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-05-06 16:08:18,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-05-06 16:08:18,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-05-06 16:08:18,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-05-06 16:08:18,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-05-06 16:08:18,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-05-06 16:08:18,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-06 16:08:18,664 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-05-06 16:08:18,668 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 16:08:18,668 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 16:08:18,731 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2024-05-06 16:08:18,733 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2024-05-06 16:08:18,733 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2024-05-06 16:08:18,738 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,738 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,739 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,741 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2024-05-06 16:08:18,745 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,745 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,745 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet7 [2024-05-06 16:08:18,747 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2024-05-06 16:08:18,749 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2024-05-06 16:08:18,749 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet19 [2024-05-06 16:08:18,749 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2024-05-06 16:08:18,749 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2024-05-06 16:08:18,750 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2024-05-06 16:08:18,750 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet21 [2024-05-06 16:08:18,750 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated [2024-05-06 16:08:18,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 04:08:18 BasicIcfg [2024-05-06 16:08:18,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 16:08:18,764 INFO L158 Benchmark]: Toolchain (without parser) took 3944.82ms. Allocated memory was 343.9MB in the beginning and 536.9MB in the end (delta: 192.9MB). Free memory was 269.2MB in the beginning and 468.9MB in the end (delta: -199.8MB). Peak memory consumption was 223.1MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,764 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 343.9MB. Free memory is still 311.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 16:08:18,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.01ms. Allocated memory is still 343.9MB. Free memory was 269.2MB in the beginning and 275.1MB in the end (delta: -5.9MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 343.9MB. Free memory was 275.1MB in the beginning and 271.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,766 INFO L158 Benchmark]: Boogie Preprocessor took 31.44ms. Allocated memory is still 343.9MB. Free memory was 271.9MB in the beginning and 268.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,766 INFO L158 Benchmark]: RCFGBuilder took 516.87ms. Allocated memory is still 343.9MB. Free memory was 268.8MB in the beginning and 238.4MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,766 INFO L158 Benchmark]: TraceAbstraction took 2681.26ms. Allocated memory was 343.9MB in the beginning and 536.9MB in the end (delta: 192.9MB). Free memory was 237.3MB in the beginning and 468.9MB in the end (delta: -231.6MB). Peak memory consumption was 190.4MB. Max. memory is 8.0GB. [2024-05-06 16:08:18,767 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 343.9MB. Free memory is still 311.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 656.01ms. Allocated memory is still 343.9MB. Free memory was 269.2MB in the beginning and 275.1MB in the end (delta: -5.9MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 343.9MB. Free memory was 275.1MB in the beginning and 271.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.44ms. Allocated memory is still 343.9MB. Free memory was 271.9MB in the beginning and 268.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 516.87ms. Allocated memory is still 343.9MB. Free memory was 268.8MB in the beginning and 238.4MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2681.26ms. Allocated memory was 343.9MB in the beginning and 536.9MB in the end (delta: 192.9MB). Free memory was 237.3MB in the beginning and 468.9MB in the end (delta: -231.6MB). Peak memory consumption was 190.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet19 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet21 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated - 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: 231, independent: 204, independent conditional: 102, independent unconditional: 102, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 204, independent: 204, independent conditional: 102, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 204, independent conditional: 102, independent unconditional: 102, 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: 204, independent: 204, independent conditional: 102, independent unconditional: 102, 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: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 59, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 59, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 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: 204, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, 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: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 204, independent: 204, independent conditional: 0, independent unconditional: 204, 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: 59, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 59, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 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: 204, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, 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 ], Independence queries for same thread: 27 - 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 [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={9: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={9:24}, data={9:0}, data={9:0}, t1={3:0}, t2={4:0}] [L1708] 0 data->shared.a = 0 VAL [d={9:24}, data={9:0}, data={9:0}, t1={3:0}, t2={4:0}] [L1709] 0 data->shared.b = 0 VAL [d={9:24}, data={9:0}, data={9:0}, t1={3:0}, t2={4:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [d={9:24}, data={9:0}, data={9:0}, res=0, t1={3:0}, t2={4:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [d={9:24}, data={9:0}, data={9:0}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={9:24}, d={9:24}, data={9:0}, data={9:0}, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={9:24}, arg={9:24}, dev={9:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={9:24}, arg={9:24}, dev={9:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, dev={9: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={9:24}, arg={9:24}, arg={9:24}, dev={9: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={9:24}, arg={9:24}, dev={9: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={9:24}, arg={9:24}, data={9:0}, dev={9:24}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={9:24}, arg={9:24}, data={9:0}, dev={9: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={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, arg={9:24}, arg={9:24}, d={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, 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={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, 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={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, 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={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, 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={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=1, t1={3:0}, t2={4:0}] [L1703] 2 return 0; VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=1, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, \result={0:0}, arg={9:24}, arg={9:24}, d={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, 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 [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, dev={9:24}, lb=1, 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 [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8:0}, t1={3:0}, t2={4:0}] [L1723] 0 data->shared.a = 3 VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8:0}, t1={3:0}, t2={4:0}] [L1726] 0 data->shared.b = 3 VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8: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 [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8:0}, t1={3:0}, t2={4:0}] [L1734] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8:0}, t1={3:0}, t2={4:0}] [L1735] 0 \read(t2) VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8:0}, t1={3:0}, t2={4:0}] [L1735] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, data={9:0}, data={9:0}, dev={9:24}, lb=1, status={8: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={9:24}, arg={9:24}, data={9:0}, data={9:0}, dev={9:24}, lb=1, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1752] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, expression=0, lb=1, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, expression=0, lb=1, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, 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: 27, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 16:08:18,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 16:08:18,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...