/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:55:27,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:55:27,443 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 16:55:27,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:55:27,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:55:27,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:55:27,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:55:27,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:55:27,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:55:27,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:55:27,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:55:27,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:55:27,470 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:55:27,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:55:27,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:55:27,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:55:27,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:27,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:27,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:55:27,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 16:55:27,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:55:27,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:55:27,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:55:27,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:55:27,670 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:55:27,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-14 16:55:28,885 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4403e8598/8e5efa7fcf09438181413b2deaf63ef1/FLAGc0bbf3d84 [2025-04-14 16:55:29,115 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:55:29,116 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-14 16:55:29,128 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4403e8598/8e5efa7fcf09438181413b2deaf63ef1/FLAGc0bbf3d84 [2025-04-14 16:55:29,886 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4403e8598/8e5efa7fcf09438181413b2deaf63ef1 [2025-04-14 16:55:29,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:55:29,889 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:55:29,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:55:29,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:55:29,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:55:29,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:55:29" (1/1) ... [2025-04-14 16:55:29,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20984277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:29, skipping insertion in model container [2025-04-14 16:55:29,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:55:29" (1/1) ... [2025-04-14 16:55:29,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:55:30,167 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-deagle/circular_buffer_bad.i[30440,30453] [2025-04-14 16:55:30,176 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-deagle/circular_buffer_bad.i[30895,30908] [2025-04-14 16:55:30,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:55:30,190 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:55:30,224 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-deagle/circular_buffer_bad.i[30440,30453] [2025-04-14 16:55:30,227 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-deagle/circular_buffer_bad.i[30895,30908] [2025-04-14 16:55:30,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:55:30,267 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:55:30,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30 WrapperNode [2025-04-14 16:55:30,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:55:30,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:55:30,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:55:30,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:55:30,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,305 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-14 16:55:30,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:55:30,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:55:30,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:55:30,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:55:30,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:55:30,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:55:30,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:55:30,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:55:30,332 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (1/1) ... [2025-04-14 16:55:30,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:30,362 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 16:55:30,364 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 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 16:55:30,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 16:55:30,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:55:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 16:55:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:55:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 16:55:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:55:30,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:55:30,380 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 16:55:30,481 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:55:30,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:55:30,709 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-04-14 16:55:30,710 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:55:30,710 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:55:30,843 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:55:30,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:55:30,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:55:30 BoogieIcfgContainer [2025-04-14 16:55:30,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:55:30,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:55:30,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:55:30,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:55:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:55:29" (1/3) ... [2025-04-14 16:55:30,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee1a82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:55:30, skipping insertion in model container [2025-04-14 16:55:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:30" (2/3) ... [2025-04-14 16:55:30,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee1a82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:55:30, skipping insertion in model container [2025-04-14 16:55:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:55:30" (3/3) ... [2025-04-14 16:55:30,850 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-04-14 16:55:30,860 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:55:30,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 35 locations, 39 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 16:55:30,861 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:55:30,909 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 16:55:30,938 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:30,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:55:30,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:30,940 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 16:55:30,942 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 16:55:31,011 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:55:31,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2025-04-14 16:55:31,030 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;@33f6c0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:31,030 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:55:33,455 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:33,455 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:33,456 INFO L139 ounterexampleChecker]: Examining path program with hash 976252264, occurence #1 [2025-04-14 16:55:33,456 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:33,456 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:33,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1228444417, now seen corresponding path program 1 times [2025-04-14 16:55:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:33,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598894190] [2025-04-14 16:55:33,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:33,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 16:55:33,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 16:55:33,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:33,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:33,701 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 16:55:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:33,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598894190] [2025-04-14 16:55:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598894190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312958606] [2025-04-14 16:55:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:33,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:33,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:33,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:33,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:33,725 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:33,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 16:55:33,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:33,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:33,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:55:33,841 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:33,841 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:33,841 INFO L139 ounterexampleChecker]: Examining path program with hash 1919092807, occurence #1 [2025-04-14 16:55:33,841 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:33,841 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:33,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1279880503, now seen corresponding path program 1 times [2025-04-14 16:55:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:33,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645905540] [2025-04-14 16:55:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:33,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-14 16:55:33,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-14 16:55:33,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:33,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 16:55:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:33,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645905540] [2025-04-14 16:55:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645905540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686453307] [2025-04-14 16:55:33,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:33,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:33,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:33,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:33,988 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:33,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 16:55:33,988 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:33,988 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:34,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 16:55:34,070 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:34,070 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:34,070 INFO L139 ounterexampleChecker]: Examining path program with hash -547961143, occurence #1 [2025-04-14 16:55:34,070 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:34,070 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:34,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:34,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1611503721, now seen corresponding path program 1 times [2025-04-14 16:55:34,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:34,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205995817] [2025-04-14 16:55:34,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:34,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:34,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 16:55:34,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 16:55:34,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:34,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:34,236 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 16:55:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:34,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205995817] [2025-04-14 16:55:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205995817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:34,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:34,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874784288] [2025-04-14 16:55:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:34,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:55:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:34,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:55:34,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:55:34,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:34,237 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:34,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 16:55:34,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:34,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:34,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 16:55:34,627 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:34,627 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:34,627 INFO L139 ounterexampleChecker]: Examining path program with hash 36656602, occurence #1 [2025-04-14 16:55:34,627 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:34,627 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:34,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -979092762, now seen corresponding path program 1 times [2025-04-14 16:55:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:34,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841983755] [2025-04-14 16:55:34,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:34,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 16:55:34,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:55:34,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:34,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:34,979 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 16:55:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:34,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841983755] [2025-04-14 16:55:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841983755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 16:55:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948506274] [2025-04-14 16:55:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:34,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 16:55:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 16:55:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 16:55:34,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:34,980 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:34,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 16:55:34,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:34,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:34,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:38,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:38,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 16:55:38,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 16:55:38,309 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 16:55:38,310 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2025-04-14 16:55:38,312 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:38,313 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:55:38,313 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:55:38,314 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;@33f6c0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:38,314 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 16:55:38,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 16:55:38,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 16:55:38,318 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 16:55:38,318 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-04-14 16:55:38,319 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:38,321 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:55:38,321 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2025-04-14 16:55:38,321 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;@33f6c0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:38,321 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:55:38,352 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:38,353 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:38,353 INFO L139 ounterexampleChecker]: Examining path program with hash 183250626, occurence #1 [2025-04-14 16:55:38,353 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:38,353 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:38,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 918152694, now seen corresponding path program 1 times [2025-04-14 16:55:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:38,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511838919] [2025-04-14 16:55:38,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:38,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 16:55:38,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 16:55:38,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:38,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:38,409 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 16:55:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:38,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511838919] [2025-04-14 16:55:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511838919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:55:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951930038] [2025-04-14 16:55:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:38,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:38,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:38,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,411 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:38,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 16:55:38,411 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 16:55:38,524 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:38,524 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:38,524 INFO L139 ounterexampleChecker]: Examining path program with hash -2058084091, occurence #1 [2025-04-14 16:55:38,525 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:38,525 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:38,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1046913587, now seen corresponding path program 1 times [2025-04-14 16:55:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:38,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959068433] [2025-04-14 16:55:38,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 16:55:38,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 16:55:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 16:55:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:38,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959068433] [2025-04-14 16:55:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959068433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:38,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:38,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385292531] [2025-04-14 16:55:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:38,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:38,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:38,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:38,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,620 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:38,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 16:55:38,620 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,620 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 16:55:38,667 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:38,667 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:38,667 INFO L139 ounterexampleChecker]: Examining path program with hash 1674129732, occurence #1 [2025-04-14 16:55:38,667 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:38,667 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:38,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -669150991, now seen corresponding path program 1 times [2025-04-14 16:55:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:38,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953515068] [2025-04-14 16:55:38,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:38,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-14 16:55:38,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 16:55:38,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:55:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:38,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953515068] [2025-04-14 16:55:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953515068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591232558] [2025-04-14 16:55:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:38,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:38,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:38,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:38,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,717 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:38,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 16:55:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 16:55:38,780 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:38,780 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:38,780 INFO L139 ounterexampleChecker]: Examining path program with hash -1276531781, occurence #1 [2025-04-14 16:55:38,781 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:38,781 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:38,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1795996641, now seen corresponding path program 1 times [2025-04-14 16:55:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:38,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829568627] [2025-04-14 16:55:38,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:55:38,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:55:38,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:38,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 16:55:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:38,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829568627] [2025-04-14 16:55:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829568627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:38,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845595592] [2025-04-14 16:55:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:38,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:38,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:38,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:38,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,854 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:38,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 16:55:38,855 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,855 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,855 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,855 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 16:55:38,894 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:38,894 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:38,894 INFO L139 ounterexampleChecker]: Examining path program with hash -2044251256, occurence #1 [2025-04-14 16:55:38,894 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:38,894 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:38,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash 5542490, now seen corresponding path program 1 times [2025-04-14 16:55:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:38,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284411034] [2025-04-14 16:55:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:38,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 16:55:38,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 16:55:38,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:38,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:38,967 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 16:55:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:38,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284411034] [2025-04-14 16:55:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284411034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:55:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051726679] [2025-04-14 16:55:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:38,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:38,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:38,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:38,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:38,968 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:38,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 16:55:38,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:38,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:39,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 16:55:39,009 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:39,009 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:39,009 INFO L139 ounterexampleChecker]: Examining path program with hash -2034889599, occurence #1 [2025-04-14 16:55:39,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:39,009 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:39,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1487932609, now seen corresponding path program 1 times [2025-04-14 16:55:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:39,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356337508] [2025-04-14 16:55:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:39,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-14 16:55:39,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 16:55:39,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:39,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:55:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:39,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356337508] [2025-04-14 16:55:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356337508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:39,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:39,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749280630] [2025-04-14 16:55:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:39,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:55:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:39,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:55:39,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:55:39,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:39,102 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:39,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 16:55:39,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,103 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,103 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,103 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:39,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 16:55:39,141 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:55:39,141 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:39,141 INFO L139 ounterexampleChecker]: Examining path program with hash -775153131, occurence #1 [2025-04-14 16:55:39,141 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:39,141 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:39,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2089458756, now seen corresponding path program 1 times [2025-04-14 16:55:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:39,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744077107] [2025-04-14 16:55:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:39,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 16:55:39,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 16:55:39,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 16:55:39,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351002609] [2025-04-14 16:55:39,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:39,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:55:39,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:39,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:55:39,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 16:55:39,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 16:55:39,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 16:55:39,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:39,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:55:39,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 16:55:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 16:55:39,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 16:55:39,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:39,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:55:39,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 16:55:39,541 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 16:55:39,541 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 16:55:39,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 16:55:39,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 16:55:39,742 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-14 16:55:39,742 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was UNSAFE (3/3) [2025-04-14 16:55:39,807 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:55:39,807 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:55:39,826 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 16:55:39,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:55:39 BasicIcfg [2025-04-14 16:55:39,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:55:39,827 INFO L158 Benchmark]: Toolchain (without parser) took 9937.95ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 106.6MB in the beginning and 214.0MB in the end (delta: -107.4MB). Peak memory consumption was 126.7MB. Max. memory is 8.0GB. [2025-04-14 16:55:39,827 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:55:39,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 82.9MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 16:55:39,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.72ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:55:39,828 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 78.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:55:39,829 INFO L158 Benchmark]: IcfgBuilder took 512.28ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 39.3MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 16:55:39,829 INFO L158 Benchmark]: TraceAbstraction took 8981.76ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 38.6MB in the beginning and 214.0MB in the end (delta: -175.4MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2025-04-14 16:55:39,830 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 82.9MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.72ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 78.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 512.28ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 39.3MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8981.76ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 38.6MB in the beginning and 214.0MB in the end (delta: -175.4MB). Peak memory consumption was 63.8MB. 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: 6579, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 571, dependent conditional: 559, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6135, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 127, dependent conditional: 115, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6135, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 127, dependent conditional: 115, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 482, dependent conditional: 470, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 2, independent unconditional: 6006, dependent: 482, dependent conditional: 42, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 2, independent unconditional: 6006, dependent: 482, dependent conditional: 42, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 775, independent: 754, independent conditional: 1, independent unconditional: 753, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 775, independent: 746, independent conditional: 0, independent unconditional: 746, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5731, independent: 884, independent conditional: 816, independent unconditional: 68, dependent: 4847, dependent conditional: 2432, dependent unconditional: 2415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6490, independent: 5254, independent conditional: 1, independent unconditional: 5253, dependent: 461, dependent conditional: 33, dependent unconditional: 428, unknown: 775, unknown conditional: 10, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 754, Positive conditional cache size: 1, Positive unconditional cache size: 753, Negative cache size: 21, Negative conditional cache size: 9, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5369, Maximal queried relation: 4, Independence queries for same thread: 444, Persistent sets #1 benchmarks: Persistent set computation time: 2.6s, Number of persistent set computation: 352, Number of trivial persistent sets: 325, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1077, independent: 1065, independent conditional: 0, independent unconditional: 1065, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6579, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 571, dependent conditional: 559, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6135, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 127, dependent conditional: 115, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6135, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 127, dependent conditional: 115, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 4943, independent unconditional: 1065, dependent: 482, dependent conditional: 470, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 2, independent unconditional: 6006, dependent: 482, dependent conditional: 42, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6490, independent: 6008, independent conditional: 2, independent unconditional: 6006, dependent: 482, dependent conditional: 42, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 775, independent: 754, independent conditional: 1, independent unconditional: 753, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 775, independent: 746, independent conditional: 0, independent unconditional: 746, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5731, independent: 884, independent conditional: 816, independent unconditional: 68, dependent: 4847, dependent conditional: 2432, dependent unconditional: 2415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6490, independent: 5254, independent conditional: 1, independent unconditional: 5253, dependent: 461, dependent conditional: 33, dependent unconditional: 428, unknown: 775, unknown conditional: 10, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 754, Positive conditional cache size: 1, Positive unconditional cache size: 753, Negative cache size: 21, Negative conditional cache size: 9, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5369, Maximal queried relation: 4, Independence queries for same thread: 444 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 173, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 171, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 6, Number of trivial persistent sets: 4, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 173, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 4, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 171, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1994, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 242, dependent conditional: 228, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 61, dependent conditional: 47, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1813, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 57, dependent conditional: 9, dependent unconditional: 48, unknown: 30, unknown conditional: 2, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 782, Positive conditional cache size: 0, Positive unconditional cache size: 782, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 883, Maximal queried relation: 4, Independence queries for same thread: 213, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 126, Number of trivial persistent sets: 108, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 919, independent: 905, independent conditional: 0, independent unconditional: 905, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1994, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 242, dependent conditional: 228, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1781, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 29, dependent conditional: 15, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 847, independent unconditional: 905, dependent: 61, dependent conditional: 47, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1813, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 61, dependent conditional: 11, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1813, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 57, dependent conditional: 9, dependent unconditional: 48, unknown: 30, unknown conditional: 2, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 782, Positive conditional cache size: 0, Positive unconditional cache size: 782, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 883, Maximal queried relation: 4, Independence queries for same thread: 213 - PositiveResult [Line: 713]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\at(b, Pre)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND TRUE 2 removeLogElement()==i [L747] 2 receive=0 [L748] 2 send=1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=1] [L740] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\at(b, Pre)=1, b=1, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] 2 reach_error() VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=1, send=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 63 locations, 76 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.3s, 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: 14, 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.7s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 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: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 63 locations, 76 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 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: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 63 locations, 76 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 37/37 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 proved your program to be incorrect! [2025-04-14 16:55:39,844 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...