/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread/twostage_3.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 10:50:39,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 10:50:39,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 10:50:39,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 10:50:39,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 10:50:39,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 10:50:39,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 10:50:39,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 10:50:39,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 10:50:39,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 10:50:39,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 10:50:39,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 10:50:39,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 10:50:39,834 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:50:39,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:50:39,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 10:50:39,835 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 10:50:39,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 10:50:39,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 10:50:39,836 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 10:50:39,836 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 10:50:39,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 10:50:40,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 10:50:40,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 10:50:40,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 10:50:40,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 10:50:40,065 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 10:50:40,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/twostage_3.i [2025-04-14 10:50:41,339 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2596a27e/4649c2fb27e64e56ab5318b187d9546a/FLAGd5e8bd73f [2025-04-14 10:50:41,632 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 10:50:41,633 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i [2025-04-14 10:50:41,651 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2596a27e/4649c2fb27e64e56ab5318b187d9546a/FLAGd5e8bd73f [2025-04-14 10:50:42,390 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2596a27e/4649c2fb27e64e56ab5318b187d9546a [2025-04-14 10:50:42,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 10:50:42,393 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 10:50:42,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 10:50:42,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 10:50:42,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 10:50:42,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:42,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b40b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42, skipping insertion in model container [2025-04-14 10:50:42,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:42,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 10:50:42,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-04-14 10:50:42,843 WARN L1730 CHandler]: Possible shadowing of function lock [2025-04-14 10:50:42,843 WARN L1730 CHandler]: Possible shadowing of function lock [2025-04-14 10:50:42,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:50:42,850 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 10:50:42,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-04-14 10:50:42,917 WARN L1730 CHandler]: Possible shadowing of function lock [2025-04-14 10:50:42,918 WARN L1730 CHandler]: Possible shadowing of function lock [2025-04-14 10:50:42,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:50:42,970 INFO L204 MainTranslator]: Completed translation [2025-04-14 10:50:42,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42 WrapperNode [2025-04-14 10:50:42,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 10:50:42,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 10:50:42,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 10:50:42,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 10:50:42,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:42,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,005 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-04-14 10:50:43,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 10:50:43,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 10:50:43,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 10:50:43,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 10:50:43,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 10:50:43,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 10:50:43,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 10:50:43,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 10:50:43,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (1/1) ... [2025-04-14 10:50:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:50:43,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:50:43,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 10:50:43,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-04-14 10:50:43,069 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-04-14 10:50:43,069 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 10:50:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 10:50:43,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 10:50:43,070 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 10:50:43,154 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 10:50:43,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 10:50:43,350 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 10:50:43,350 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 10:50:43,511 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 10:50:43,513 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 10:50:43,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:50:43 BoogieIcfgContainer [2025-04-14 10:50:43,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 10:50:43,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 10:50:43,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 10:50:43,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 10:50:43,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:50:42" (1/3) ... [2025-04-14 10:50:43,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f87533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:50:43, skipping insertion in model container [2025-04-14 10:50:43,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:42" (2/3) ... [2025-04-14 10:50:43,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f87533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:50:43, skipping insertion in model container [2025-04-14 10:50:43,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:50:43" (3/3) ... [2025-04-14 10:50:43,520 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-04-14 10:50:43,528 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 10:50:43,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 10:50:43,530 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 10:50:43,569 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 10:50:43,598 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:50:43,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 10:50:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:50:43,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 10:50:43,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 10:50:43,662 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:50:43,675 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 10:50:43,682 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5525ce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:50:43,682 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 10:50:43,826 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:50:43,826 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:43,826 INFO L139 ounterexampleChecker]: Examining path program with hash 607043317, occurence #1 [2025-04-14 10:50:43,826 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:43,826 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:43,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1847419089, now seen corresponding path program 1 times [2025-04-14 10:50:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:43,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407602155] [2025-04-14 10:50:43,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:50:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:43,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 10:50:43,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 10:50:43,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:43,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:50:43,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 10:50:43,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 10:50:43,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 10:50:43,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:43,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:50:43,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 10:50:43,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 10:50:43,993 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 10:50:43,994 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 10:50:43,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 10:50:43,998 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 10:50:44,001 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-04-14 10:50:44,001 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 10:50:44,001 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 10:50:44,036 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-14 10:50:44,042 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:50:44,050 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:50:44,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-04-14 10:50:44,050 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5525ce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:50:44,050 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 10:50:44,514 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:44,515 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:44,515 INFO L139 ounterexampleChecker]: Examining path program with hash 1235379600, occurence #1 [2025-04-14 10:50:44,515 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:44,515 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:44,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 164239484, now seen corresponding path program 1 times [2025-04-14 10:50:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:44,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436549030] [2025-04-14 10:50:44,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:50:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:44,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 10:50:44,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 10:50:44,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:44,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:44,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436549030] [2025-04-14 10:50:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436549030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 10:50:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671384207] [2025-04-14 10:50:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:44,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:50:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:44,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:50:44,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:50:44,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:44,645 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:44,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) [2025-04-14 10:50:44,645 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:45,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:45,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 10:50:45,530 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:45,530 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:45,531 INFO L139 ounterexampleChecker]: Examining path program with hash 404939300, occurence #1 [2025-04-14 10:50:45,531 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:45,531 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:45,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1735076406, now seen corresponding path program 1 times [2025-04-14 10:50:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:45,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547204481] [2025-04-14 10:50:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:50:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:45,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 10:50:45,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 10:50:45,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:45,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547204481] [2025-04-14 10:50:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547204481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:45,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:45,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 10:50:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644939522] [2025-04-14 10:50:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:45,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:50:45,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:45,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:50:45,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:50:45,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:45,884 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:45,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2025-04-14 10:50:45,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:45,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:46,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:46,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:46,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 10:50:46,917 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:46,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:46,918 INFO L139 ounterexampleChecker]: Examining path program with hash 1089909145, occurence #1 [2025-04-14 10:50:46,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:46,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:46,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash -843293123, now seen corresponding path program 1 times [2025-04-14 10:50:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:46,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412070353] [2025-04-14 10:50:46,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:50:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:46,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-14 10:50:46,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 10:50:46,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:47,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412070353] [2025-04-14 10:50:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412070353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 10:50:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960898384] [2025-04-14 10:50:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:47,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:50:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:47,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:50:47,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:50:47,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:47,188 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:47,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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) [2025-04-14 10:50:47,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:47,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:47,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:48,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:48,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:48,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:48,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 10:50:48,114 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:48,114 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:48,114 INFO L139 ounterexampleChecker]: Examining path program with hash 1033029450, occurence #1 [2025-04-14 10:50:48,114 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:48,114 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:48,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1384462749, now seen corresponding path program 2 times [2025-04-14 10:50:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:48,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168031841] [2025-04-14 10:50:48,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:50:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:48,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-04-14 10:50:48,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 10:50:48,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 10:50:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:48,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168031841] [2025-04-14 10:50:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168031841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:48,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:48,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 10:50:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347437835] [2025-04-14 10:50:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:48,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:50:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:48,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:50:48,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:50:48,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:48,325 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:48,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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) [2025-04-14 10:50:48,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:48,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:48,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:48,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:49,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:49,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:49,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:49,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:49,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 10:50:49,667 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:49,667 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:49,667 INFO L139 ounterexampleChecker]: Examining path program with hash -1851441042, occurence #1 [2025-04-14 10:50:49,667 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:49,667 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:49,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1699343691, now seen corresponding path program 3 times [2025-04-14 10:50:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:49,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912005002] [2025-04-14 10:50:49,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:50:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:49,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-04-14 10:50:49,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 10:50:49,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 10:50:49,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:49,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912005002] [2025-04-14 10:50:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912005002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 10:50:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329367125] [2025-04-14 10:50:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:49,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:50:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:49,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:50:49,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:50:49,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:49,831 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:49,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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) [2025-04-14 10:50:49,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:49,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:49,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:49,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:49,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:54,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:54,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:54,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:54,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:54,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:50:54,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 10:50:54,628 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:54,628 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:54,628 INFO L139 ounterexampleChecker]: Examining path program with hash -426032913, occurence #1 [2025-04-14 10:50:54,628 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:54,628 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:54,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1357286204, now seen corresponding path program 2 times [2025-04-14 10:50:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:54,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109939309] [2025-04-14 10:50:54,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:50:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:54,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-04-14 10:50:54,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 10:50:54,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 10:50:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:54,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109939309] [2025-04-14 10:50:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109939309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 10:50:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89562419] [2025-04-14 10:50:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:54,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 10:50:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:54,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 10:50:54,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 10:50:54,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:54,733 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:54,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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) [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:50:54,733 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:56,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:56,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:56,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:56,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:56,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:50:56,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:56,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 10:50:56,742 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:56,742 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:56,742 INFO L139 ounterexampleChecker]: Examining path program with hash 2112011107, occurence #1 [2025-04-14 10:50:56,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:56,742 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:56,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -280526180, now seen corresponding path program 1 times [2025-04-14 10:50:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:56,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125174166] [2025-04-14 10:50:56,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:50:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:56,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 10:50:56,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 10:50:56,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:56,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:50:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:50:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:50:56,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125174166] [2025-04-14 10:50:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125174166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:50:56,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:50:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 10:50:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17525159] [2025-04-14 10:50:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:50:56,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:50:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:50:56,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:50:56,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:50:56,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:56,954 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:50:56,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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) [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:56,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:50:59,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:50:59,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:59,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:59,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:50:59,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:50:59,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:50:59,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:50:59,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 10:50:59,170 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:50:59,170 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:50:59,170 INFO L139 ounterexampleChecker]: Examining path program with hash -1790076643, occurence #1 [2025-04-14 10:50:59,170 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:50:59,170 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:50:59,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:50:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1504229498, now seen corresponding path program 2 times [2025-04-14 10:50:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:50:59,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486779835] [2025-04-14 10:50:59,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:50:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:50:59,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-04-14 10:50:59,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 10:50:59,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 10:50:59,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:50:59,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 10:50:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 10:50:59,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 10:50:59,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:50:59,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:50:59,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 10:50:59,230 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 10:50:59,230 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 10:50:59,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 10:50:59,232 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1] [2025-04-14 10:50:59,232 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-04-14 10:50:59,318 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-14 10:50:59,318 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 10:50:59,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 10:50:59,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:50:59 BasicIcfg [2025-04-14 10:50:59,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 10:50:59,337 INFO L158 Benchmark]: Toolchain (without parser) took 16943.83ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 99.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 728.2MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,337 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:50:59,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.48ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 57.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 54.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,339 INFO L158 Benchmark]: Boogie Preprocessor took 18.97ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 52.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,339 INFO L158 Benchmark]: RCFGBuilder took 488.48ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 79.9MB in the end (delta: -27.7MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,339 INFO L158 Benchmark]: TraceAbstraction took 15821.00ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 79.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 708.4MB. Max. memory is 8.0GB. [2025-04-14 10:50:59,340 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.48ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 57.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 54.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.97ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 52.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 488.48ms. Allocated memory is still 142.6MB. Free memory was 52.3MB in the beginning and 79.9MB in the end (delta: -27.7MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. * TraceAbstraction took 15821.00ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 79.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 708.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 14, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42818, dependent conditional: 42631, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5483, independent: 5235, independent conditional: 44, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5483, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3007, independent: 1247, independent conditional: 287, independent unconditional: 960, dependent: 1760, dependent conditional: 294, dependent unconditional: 1466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103878, independent: 1055825, independent conditional: 776, independent unconditional: 1055049, dependent: 42570, dependent conditional: 3829, dependent unconditional: 38741, unknown: 5483, unknown conditional: 103, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5738, Positive cache size: 5487, Positive conditional cache size: 44, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093415, Maximal queried relation: 6, Independence queries for same thread: 73380, Persistent sets #1 benchmarks: Persistent set computation time: 4.0s, Number of persistent set computation: 47392, Number of trivial persistent sets: 38283, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5755, independent: 5568, independent conditional: 0, independent unconditional: 5568, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42818, dependent conditional: 42631, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5483, independent: 5235, independent conditional: 44, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5483, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3007, independent: 1247, independent conditional: 287, independent unconditional: 960, dependent: 1760, dependent conditional: 294, dependent unconditional: 1466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103878, independent: 1055825, independent conditional: 776, independent unconditional: 1055049, dependent: 42570, dependent conditional: 3829, dependent unconditional: 38741, unknown: 5483, unknown conditional: 103, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5738, Positive cache size: 5487, Positive conditional cache size: 44, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093415, Maximal queried relation: 6, Independence queries for same thread: 73380 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] EXPR, FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1310] EXPR 0 err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) [L1310] COND FALSE 0 !(0 != (err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)))) [L1309] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={6:0}, t1=1, t1=1, t2=0, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={6:0}, t1=1, t1=1, t2=0, tPool={5:0}] [L1258] 3 int t1 = -1; [L1259] 3 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1261] COND FALSE 3 !(data1Value == 0) [L1265] 3 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1268] 3 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, \result={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 80 locations, 89 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 0, 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.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread2of2ForFork0 with 1 thread instances CFG has 7 procedures, 112 locations, 127 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 13.7s, 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: 48, 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, 1.2s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-14 10:50:59,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...