/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 14:22:24,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 14:22:24,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 14:22:24,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 14:22:24,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 14:22:24,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 14:22:24,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 14:22:24,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 14:22:24,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 14:22:24,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 14:22:24,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 14:22:24,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 14:22:24,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 14:22:24,606 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 14:22:24,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 14:22:24,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 14:22:24,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 14:22:24,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 14:22:24,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 14:22:24,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 14:22:24,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 14:22:24,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 14:22:24,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 14:22:24,608 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 14:22:24,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 14:22:24,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:22:24,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 14:22:24,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 14:22:24,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 14:22:24,611 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 14:22:24,611 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 14:22:24,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 14:22:24,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 14:22:24,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 14:22:24,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 14:22:24,809 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 14:22:24,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-05-30 14:22:25,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 14:22:26,129 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 14:22:26,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-05-30 14:22:26,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5954f3944/115957d9205d4c13ba6cc4b83c4fdbed/FLAGee481b907 [2024-05-30 14:22:26,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5954f3944/115957d9205d4c13ba6cc4b83c4fdbed [2024-05-30 14:22:26,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 14:22:26,183 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 14:22:26,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 14:22:26,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 14:22:26,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 14:22:26,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1355146f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26, skipping insertion in model container [2024-05-30 14:22:26,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,247 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 14:22:26,712 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2024-05-30 14:22:26,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:22:26,769 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 14:22:26,801 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2024-05-30 14:22:26,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:22:26,893 INFO L206 MainTranslator]: Completed translation [2024-05-30 14:22:26,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26 WrapperNode [2024-05-30 14:22:26,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 14:22:26,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 14:22:26,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 14:22:26,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 14:22:26,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,961 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2024-05-30 14:22:26,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 14:22:26,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 14:22:26,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 14:22:26,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 14:22:26,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:26,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:27,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:27,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:27,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 14:22:27,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 14:22:27,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 14:22:27,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 14:22:27,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (1/1) ... [2024-05-30 14:22:27,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:22:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:27,056 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-30 14:22:27,057 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-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 14:22:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 14:22:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-30 14:22:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 14:22:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 14:22:27,092 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 14:22:27,297 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 14:22:27,299 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 14:22:27,482 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 14:22:27,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 14:22:27,521 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-30 14:22:27,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:22:27 BoogieIcfgContainer [2024-05-30 14:22:27,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 14:22:27,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 14:22:27,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 14:22:27,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 14:22:27,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 02:22:26" (1/3) ... [2024-05-30 14:22:27,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cdcab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:22:27, skipping insertion in model container [2024-05-30 14:22:27,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:22:26" (2/3) ... [2024-05-30 14:22:27,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cdcab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:22:27, skipping insertion in model container [2024-05-30 14:22:27,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:22:27" (3/3) ... [2024-05-30 14:22:27,528 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-05-30 14:22:27,535 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 14:22:27,542 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 14:22:27,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-05-30 14:22:27,543 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 14:22:27,610 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 14:22:27,648 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:22:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:22:27,651 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-30 14:22:27,658 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-30 14:22:27,693 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:22:27,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:22:27,706 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;@37dd4009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:22:27,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:22:27,714 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:22:27,749 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 61 states. [2024-05-30 14:22:27,749 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:22:27,752 INFO L78 Accepts]: Start accepts. Automaton has currently 64 states, but on-demand construction may add more states Word has length 54 [2024-05-30 14:22:27,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:22:27,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:22:27,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:22:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1097834492, now seen corresponding path program 1 times [2024-05-30 14:22:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:22:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770788853] [2024-05-30 14:22:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:22:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:22:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:22:28,412 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-30 14:22:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:22:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770788853] [2024-05-30 14:22:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770788853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:22:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:22:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 14:22:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504880706] [2024-05-30 14:22:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:22:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 14:22:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:22:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 14:22:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 14:22:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:28,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:22:28,440 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-30 14:22:28,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:22:28,440 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:23:23,248 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 10716 states. [2024-05-30 14:23:23,248 INFO L212 cStratifiedReduction]: Copied states 283 times. [2024-05-30 14:23:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:23:23,249 INFO L78 Accepts]: Start accepts. Automaton has currently 11080 states, but on-demand construction may add more states Word has length 77 [2024-05-30 14:23:23,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:23:23,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 14:23:23,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:23:23,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:23:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 742350497, now seen corresponding path program 1 times [2024-05-30 14:23:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:23:23,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123392557] [2024-05-30 14:23:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:23:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:23:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:23:23,369 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-30 14:23:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:23:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123392557] [2024-05-30 14:23:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123392557] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:23:23,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:23:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 14:23:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076693357] [2024-05-30 14:23:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:23:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 14:23:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:23:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 14:23:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 14:23:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:23,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:23:23,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-30 14:23:23,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:23:23,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:23:23,377 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:42,349 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 7346 states. [2024-05-30 14:24:42,349 INFO L212 cStratifiedReduction]: Copied states 1753 times. [2024-05-30 14:24:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 14:24:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 14:24:42,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:24:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 14:24:42,406 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 14:24:42,409 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2024-05-30 14:24:42,422 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:42,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:24:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:24:42,466 INFO L229 MonitoredProcess]: Starting monitored process 3 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-30 14:24:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 14:24:42,489 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:24:42,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:24:42,490 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;@37dd4009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:24:42,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:24:42,490 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:42,505 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 170 states. [2024-05-30 14:24:42,505 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:24:42,505 INFO L78 Accepts]: Start accepts. Automaton has currently 173 states, but on-demand construction may add more states Word has length 102 [2024-05-30 14:24:42,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:42,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:42,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1775666171, now seen corresponding path program 1 times [2024-05-30 14:24:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:42,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211007443] [2024-05-30 14:24:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:42,908 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-30 14:24:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211007443] [2024-05-30 14:24:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211007443] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:24:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814936087] [2024-05-30 14:24:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 14:24:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 14:24:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 14:24:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:42,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:42,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 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-30 14:24:42,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:42,912 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:45,449 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 311 states. [2024-05-30 14:24:45,449 INFO L212 cStratifiedReduction]: Copied states 21 times. [2024-05-30 14:24:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:24:45,450 INFO L78 Accepts]: Start accepts. Automaton has currently 291 states, but on-demand construction may add more states Word has length 98 [2024-05-30 14:24:45,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:45,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 14:24:45,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:45,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -181342207, now seen corresponding path program 1 times [2024-05-30 14:24:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891972089] [2024-05-30 14:24:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:46,371 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-30 14:24:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891972089] [2024-05-30 14:24:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891972089] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:46,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-30 14:24:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960466984] [2024-05-30 14:24:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:46,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-30 14:24:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-30 14:24:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-05-30 14:24:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:46,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:46,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 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-30 14:24:46,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:24:46,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:46,374 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:24:57,070 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 493 states. [2024-05-30 14:24:57,070 INFO L212 cStratifiedReduction]: Copied states 144 times. [2024-05-30 14:24:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:24:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 14:24:57,071 INFO L78 Accepts]: Start accepts. Automaton has currently 356 states, but on-demand construction may add more states Word has length 98 [2024-05-30 14:24:57,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:24:57,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 14:24:57,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:24:57,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:24:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 584837219, now seen corresponding path program 2 times [2024-05-30 14:24:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:24:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528501823] [2024-05-30 14:24:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:24:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:24:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:24:58,859 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-30 14:24:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:24:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528501823] [2024-05-30 14:24:58,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528501823] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:24:58,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:24:58,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-05-30 14:24:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208234833] [2024-05-30 14:24:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:24:58,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-30 14:24:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:24:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-30 14:24:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-05-30 14:24:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:58,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:24:58,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 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-30 14:24:58,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:24:58,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-30 14:24:58,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:24:58,862 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:25:16,762 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 653 states. [2024-05-30 14:25:16,763 INFO L212 cStratifiedReduction]: Copied states 147 times. [2024-05-30 14:25:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:25:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 14:25:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-30 14:25:16,765 INFO L78 Accepts]: Start accepts. Automaton has currently 533 states, but on-demand construction may add more states Word has length 98 [2024-05-30 14:25:16,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:25:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 14:25:16,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:25:16,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:25:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1319128989, now seen corresponding path program 3 times [2024-05-30 14:25:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:25:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396919709] [2024-05-30 14:25:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:25:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:25:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:25:16,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:25:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:25:16,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:25:16,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:25:16,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:25:16,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 14:25:16,886 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-05-30 14:25:16,886 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (2/8) [2024-05-30 14:25:16,889 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 14:25:16,889 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 14:25:16,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 02:25:16 BasicIcfg [2024-05-30 14:25:16,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 14:25:16,956 INFO L158 Benchmark]: Toolchain (without parser) took 170772.75ms. Allocated memory was 187.7MB in the beginning and 855.6MB in the end (delta: 667.9MB). Free memory was 117.8MB in the beginning and 244.3MB in the end (delta: -126.5MB). Peak memory consumption was 543.0MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,956 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 14:25:16,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.70ms. Allocated memory was 187.7MB in the beginning and 267.4MB in the end (delta: 79.7MB). Free memory was 117.6MB in the beginning and 200.5MB in the end (delta: -83.0MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.68ms. Allocated memory is still 267.4MB. Free memory was 200.5MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,957 INFO L158 Benchmark]: Boogie Preprocessor took 55.66ms. Allocated memory is still 267.4MB. Free memory was 197.4MB in the beginning and 194.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,957 INFO L158 Benchmark]: RCFGBuilder took 503.65ms. Allocated memory is still 267.4MB. Free memory was 194.3MB in the beginning and 163.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,957 INFO L158 Benchmark]: TraceAbstraction took 169432.30ms. Allocated memory was 267.4MB in the beginning and 855.6MB in the end (delta: 588.3MB). Free memory was 162.8MB in the beginning and 244.3MB in the end (delta: -81.5MB). Peak memory consumption was 507.3MB. Max. memory is 8.0GB. [2024-05-30 14:25:16,958 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 187.7MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 707.70ms. Allocated memory was 187.7MB in the beginning and 267.4MB in the end (delta: 79.7MB). Free memory was 117.6MB in the beginning and 200.5MB in the end (delta: -83.0MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.68ms. Allocated memory is still 267.4MB. Free memory was 200.5MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.66ms. Allocated memory is still 267.4MB. Free memory was 197.4MB in the beginning and 194.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 503.65ms. Allocated memory is still 267.4MB. Free memory was 194.3MB in the beginning and 163.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 169432.30ms. Allocated memory was 267.4MB in the beginning and 855.6MB in the end (delta: 588.3MB). Free memory was 162.8MB in the beginning and 244.3MB in the end (delta: -81.5MB). Peak memory consumption was 507.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33324, independent: 33003, independent conditional: 33003, independent unconditional: 0, dependent: 281, dependent conditional: 281, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33176, independent: 33003, independent conditional: 33003, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33176, independent: 33003, independent conditional: 33003, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33449, independent: 33003, independent conditional: 0, independent unconditional: 33003, dependent: 331, dependent conditional: 198, dependent unconditional: 133, unknown: 115, unknown conditional: 75, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33449, independent: 33003, independent conditional: 0, independent unconditional: 33003, dependent: 331, dependent conditional: 0, dependent unconditional: 331, unknown: 115, unknown conditional: 0, unknown unconditional: 115] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33449, independent: 33003, independent conditional: 0, independent unconditional: 33003, dependent: 331, dependent conditional: 0, dependent unconditional: 331, unknown: 115, unknown conditional: 0, unknown unconditional: 115] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33176, independent: 33003, independent conditional: 0, independent unconditional: 33003, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33176, independent: 32963, independent conditional: 0, independent unconditional: 32963, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 213, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 213, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121124, independent: 422, independent conditional: 0, independent unconditional: 422, dependent: 78811, dependent conditional: 0, dependent unconditional: 78811, unknown: 41891, unknown conditional: 0, unknown unconditional: 41891] , Protected Queries: 0 ], Cache Queries: [ total: 33449, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 33251, unknown conditional: 0, unknown unconditional: 33251] , Statistics on independence cache: Total cache size (in pairs): 33136, Positive cache size: 33003, Positive conditional cache size: 0, Positive unconditional cache size: 33003, Negative cache size: 133, Negative conditional cache size: 0, Negative unconditional cache size: 133, Unknown cache size: 40, Unknown conditional cache size: 0, Unknown unconditional cache size: 40, Eliminated conditions: 273, Maximal queried relation: 2, Independence queries for same thread: 148 - StatisticsResult: Reduction benchmarks 34.9ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 61, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 54807.5ms Time before loop, 0.0ms Time in loop, 54.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10716, Duplicate States: 283, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 78971.8ms Time before loop, 0.0ms Time in loop, 79.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 7346, Duplicate States: 1753, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 61, Transitions: 60, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 10651, Transitions: 10903, Traversal time: 54.8s - StatisticsResult: Visitor Statistics States: 7340, Transitions: 7945, Traversal time: 79.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 21, Times there's more than one choice: 6, Avg number of choices: 1.2857142857142858 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 814, independent: 771, independent conditional: 771, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 810, independent: 771, independent conditional: 771, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 810, independent: 771, independent conditional: 771, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 771, independent conditional: 0, independent unconditional: 771, dependent: 79, dependent conditional: 56, dependent unconditional: 23, unknown: 56, unknown conditional: 40, unknown unconditional: 16] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 906, independent: 771, independent conditional: 0, independent unconditional: 771, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 906, independent: 771, independent conditional: 0, independent unconditional: 771, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 810, independent: 771, independent conditional: 0, independent unconditional: 771, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 810, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 45, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27690, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 10506, dependent conditional: 0, dependent unconditional: 10506, unknown: 17091, unknown conditional: 0, unknown unconditional: 17091] , Protected Queries: 0 ], Cache Queries: [ total: 906, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 850, unknown conditional: 0, unknown unconditional: 850] , Statistics on independence cache: Total cache size (in pairs): 794, Positive cache size: 771, Positive conditional cache size: 0, Positive unconditional cache size: 771, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 16, Unknown conditional cache size: 0, Unknown unconditional cache size: 16, Eliminated conditions: 96, Maximal queried relation: 3, Independence queries for same thread: 4 - StatisticsResult: Reduction benchmarks 14.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 170, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 2536.0ms Time before loop, 0.0ms Time in loop, 2.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 311, Duplicate States: 21, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 10695.2ms Time before loop, 0.0ms Time in loop, 10.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 493, Duplicate States: 144, Protected Variables: 25 - StatisticsResult: Reduction benchmarks 17900.1ms Time before loop, 0.0ms Time in loop, 17.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 653, Duplicate States: 147, Protected Variables: 38 - StatisticsResult: Visitor Statistics States: 117, Transitions: 116, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 254, Transitions: 269, Traversal time: 2.5s - StatisticsResult: Visitor Statistics States: 435, Transitions: 466, Traversal time: 10.7s - StatisticsResult: Visitor Statistics States: 592, Transitions: 634, Traversal time: 17.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 57, Times there's more than one choice: 45, Avg number of choices: 2.2280701754385963 - PositiveResult [Line: 1675]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - 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={6: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={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1708] 0 data->shared.a = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1709] 0 data->shared.b = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, arg={6:24}, d={6:24}, data={6:0}, data={6: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={6:24}, data={6: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={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, 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 [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, 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 [arg={6:24}, arg={6:24}, dev={6:24}, 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 [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6: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={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6: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={6:24}, arg={6:24}, data={6:0}, dev={6: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={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6: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={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6: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={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=3, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=3, t1={3:0}, t2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 134.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 133.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 31.2s, 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: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 2381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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! [2024-05-30 14:25:17,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-30 14:25:17,215 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-30 14:25:17,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...