/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 10:50:57,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 10:50:57,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 10:50:57,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 10:50:57,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 10:50:57,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 10:50:57,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 10:50:57,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 10:50:57,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 10:50:57,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 10:50:57,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 10:50:57,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 10:50:57,493 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 10:50:57,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 10:50:57,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:50:57,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:50:57,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:50:57,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 10:50:57,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 10:50:57,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 10:50:57,496 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 10:50:57,496 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 10:50:57,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 10:50:57,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 10:50:57,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 10:50:57,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 10:50:57,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 10:50:57,715 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 10:50:57,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-14 10:50:58,953 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a34ea21/49191e5cb26949f9886b64bd0fed4b47/FLAG91ee95d6f [2025-04-14 10:50:59,199 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 10:50:59,199 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-14 10:50:59,215 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a34ea21/49191e5cb26949f9886b64bd0fed4b47/FLAG91ee95d6f [2025-04-14 10:50:59,954 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a34ea21/49191e5cb26949f9886b64bd0fed4b47 [2025-04-14 10:50:59,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 10:50:59,957 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 10:50:59,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 10:50:59,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 10:50:59,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 10:50:59,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:50:59" (1/1) ... [2025-04-14 10:50:59,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bd4a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:50:59, skipping insertion in model container [2025-04-14 10:50:59,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:50:59" (1/1) ... [2025-04-14 10:50:59,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 10:51:00,266 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-atomic/read_write_lock-2.i[31244,31257] [2025-04-14 10:51:00,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:51:00,282 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 10:51:00,343 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-atomic/read_write_lock-2.i[31244,31257] [2025-04-14 10:51:00,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:51:00,372 INFO L204 MainTranslator]: Completed translation [2025-04-14 10:51:00,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00 WrapperNode [2025-04-14 10:51:00,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 10:51:00,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 10:51:00,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 10:51:00,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 10:51:00,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,407 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-04-14 10:51:00,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 10:51:00,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 10:51:00,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 10:51:00,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 10:51:00,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 10:51:00,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 10:51:00,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 10:51:00,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 10:51:00,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (1/1) ... [2025-04-14 10:51:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:51:00,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:51:00,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 10:51:00,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 10:51:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 10:51:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 10:51:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-04-14 10:51:00,469 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-04-14 10:51:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 10:51:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 10:51:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 10:51:00,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 10:51:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-14 10:51:00,469 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-14 10:51:00,470 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 10:51:00,547 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 10:51:00,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 10:51:00,643 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 10:51:00,643 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 10:51:00,709 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 10:51:00,709 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 10:51:00,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:51:00 BoogieIcfgContainer [2025-04-14 10:51:00,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 10:51:00,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 10:51:00,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 10:51:00,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 10:51:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:50:59" (1/3) ... [2025-04-14 10:51:00,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4596c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:51:00, skipping insertion in model container [2025-04-14 10:51:00,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:51:00" (2/3) ... [2025-04-14 10:51:00,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4596c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:51:00, skipping insertion in model container [2025-04-14 10:51:00,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:51:00" (3/3) ... [2025-04-14 10:51:00,716 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-04-14 10:51:00,726 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 10:51:00,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 34 locations, 32 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 10:51:00,728 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 10:51:00,780 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 10:51:00,808 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:51:00,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 10:51:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:51:00,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 10:51:00,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 10:51:00,878 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:51:00,889 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of1ForFork2 ======== [2025-04-14 10:51:00,893 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;@3492c7a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:51:00,894 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 10:51:01,231 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:01,231 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:01,231 INFO L139 ounterexampleChecker]: Examining path program with hash -1985696277, occurence #1 [2025-04-14 10:51:01,231 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:01,231 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:01,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -205277295, now seen corresponding path program 1 times [2025-04-14 10:51:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:01,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127960698] [2025-04-14 10:51:01,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:01,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 10:51:01,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 10:51:01,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:01,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:01,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127960698] [2025-04-14 10:51:01,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127960698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:01,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:51:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75476202] [2025-04-14 10:51:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:01,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 10:51:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:01,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 10:51:01,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 10:51:01,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:01,534 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:01,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:01,535 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:01,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:01,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 10:51:01,663 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:01,664 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:01,664 INFO L139 ounterexampleChecker]: Examining path program with hash -205097161, occurence #1 [2025-04-14 10:51:01,664 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:01,664 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:01,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash 898651023, now seen corresponding path program 1 times [2025-04-14 10:51:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:01,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759907389] [2025-04-14 10:51:01,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 10:51:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 10:51:01,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:01,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:01,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759907389] [2025-04-14 10:51:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759907389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:01,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:01,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 10:51:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701017946] [2025-04-14 10:51:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:01,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 10:51:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:01,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 10:51:01,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 10:51:01,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:01,809 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:01,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:01,809 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:01,809 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:01,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:01,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:51:01,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 10:51:01,967 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:01,967 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:01,967 INFO L139 ounterexampleChecker]: Examining path program with hash 1395355432, occurence #1 [2025-04-14 10:51:01,967 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:01,967 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:01,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1379971855, now seen corresponding path program 1 times [2025-04-14 10:51:01,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:01,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773206223] [2025-04-14 10:51:01,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:01,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 10:51:01,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 10:51:01,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:02,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773206223] [2025-04-14 10:51:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773206223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 10:51:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167367791] [2025-04-14 10:51:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:02,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 10:51:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:02,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 10:51:02,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 10:51:02,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,051 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:02,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:02,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:51:02,051 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 10:51:02,219 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:02,219 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:02,219 INFO L139 ounterexampleChecker]: Examining path program with hash 6213136, occurence #1 [2025-04-14 10:51:02,219 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:02,219 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:02,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -805688650, now seen corresponding path program 1 times [2025-04-14 10:51:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:02,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741269759] [2025-04-14 10:51:02,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:02,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 10:51:02,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 10:51:02,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:02,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:02,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:02,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741269759] [2025-04-14 10:51:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741269759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:02,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:02,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:51:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033689745] [2025-04-14 10:51:02,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:02,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:51:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:02,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:51:02,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:51:02,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,292 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:02,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:02,292 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,292 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,292 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,292 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:02,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 10:51:02,350 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:02,350 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:02,350 INFO L139 ounterexampleChecker]: Examining path program with hash 778459833, occurence #1 [2025-04-14 10:51:02,350 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:02,350 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:02,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash -471105172, now seen corresponding path program 2 times [2025-04-14 10:51:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:02,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130501292] [2025-04-14 10:51:02,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:51:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:02,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-04-14 10:51:02,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 10:51:02,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 10:51:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:02,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130501292] [2025-04-14 10:51:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130501292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 10:51:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600040796] [2025-04-14 10:51:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:02,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 10:51:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:02,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 10:51:02,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 10:51:02,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,454 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:02,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:02,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:02,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:02,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:51:02,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 10:51:02,622 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:02,622 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:02,622 INFO L139 ounterexampleChecker]: Examining path program with hash -1129319880, occurence #1 [2025-04-14 10:51:02,622 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:02,622 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:02,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -321857556, now seen corresponding path program 3 times [2025-04-14 10:51:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:02,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380462601] [2025-04-14 10:51:02,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:51:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:02,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-04-14 10:51:02,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 10:51:02,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 10:51:02,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:02,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380462601] [2025-04-14 10:51:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380462601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 10:51:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544635546] [2025-04-14 10:51:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:02,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 10:51:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:02,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 10:51:02,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-14 10:51:02,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:02,740 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:02,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:51:02,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:03,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:03,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 10:51:03,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:03,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:03,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:51:03,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:51:03,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 10:51:03,141 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:03,141 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:03,141 INFO L139 ounterexampleChecker]: Examining path program with hash -633200404, occurence #1 [2025-04-14 10:51:03,141 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:03,141 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:03,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 678743592, now seen corresponding path program 1 times [2025-04-14 10:51:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:03,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921019158] [2025-04-14 10:51:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:03,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 10:51:03,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 10:51:03,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:51:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:51:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:51:03,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921019158] [2025-04-14 10:51:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921019158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:51:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:51:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 10:51:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445137338] [2025-04-14 10:51:03,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:51:03,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 10:51:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:51:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 10:51:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 10:51:03,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:03,227 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:51:03,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:51:03,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 10:51:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:51:03,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 10:51:03,916 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 10:51:03,916 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:51:03,916 INFO L139 ounterexampleChecker]: Examining path program with hash -379371148, occurence #1 [2025-04-14 10:51:03,916 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:51:03,916 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:51:03,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:51:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1023048594, now seen corresponding path program 1 times [2025-04-14 10:51:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:51:03,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358915095] [2025-04-14 10:51:03,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:51:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:51:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 10:51:03,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 10:51:03,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:03,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:51:03,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 10:51:03,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 10:51:03,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 10:51:03,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:51:03,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:51:03,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 10:51:03,945 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 10:51:03,946 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 10:51:03,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 10:51:03,951 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-04-14 10:51:03,952 INFO L320 ceAbstractionStarter]: Result for error location readerThread1of1ForFork2 was UNSAFE (1/3) [2025-04-14 10:51:04,029 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 10:51:04,032 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 10:51:04,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 10:51:04,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:51:04 BasicIcfg [2025-04-14 10:51:04,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 10:51:04,043 INFO L158 Benchmark]: Toolchain (without parser) took 4085.91ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 96.8MB in the beginning and 223.1MB in the end (delta: -126.2MB). Peak memory consumption was 75.1MB. Max. memory is 8.0GB. [2025-04-14 10:51:04,043 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:51:04,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.02ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 74.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 10:51:04,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 71.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:51:04,044 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 71.1MB in the end (delta: 789.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:51:04,044 INFO L158 Benchmark]: RCFGBuilder took 280.22ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 50.9MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 10:51:04,044 INFO L158 Benchmark]: TraceAbstraction took 3331.00ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 50.1MB in the beginning and 223.1MB in the end (delta: -173.0MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2025-04-14 10:51:04,045 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.15ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.02ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 74.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 71.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 71.1MB in the end (delta: 789.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 280.22ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 50.9MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3331.00ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 50.1MB in the beginning and 223.1MB in the end (delta: -173.0MB). Peak memory consumption was 29.0MB. 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: 10240, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 183, dependent conditional: 133, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10212, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 155, dependent conditional: 105, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10212, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 155, dependent conditional: 105, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 828, dependent conditional: 778, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 79, independent unconditional: 9978, dependent: 828, dependent conditional: 275, dependent unconditional: 553, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 79, independent unconditional: 9978, dependent: 828, dependent conditional: 275, dependent unconditional: 553, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1737, independent: 1655, independent conditional: 14, independent unconditional: 1641, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1737, independent: 1624, independent conditional: 0, independent unconditional: 1624, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 113, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 685, independent: 185, independent conditional: 31, independent unconditional: 154, dependent: 499, dependent conditional: 153, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10885, independent: 8402, independent conditional: 65, independent unconditional: 8337, dependent: 746, dependent conditional: 243, dependent unconditional: 503, unknown: 1737, unknown conditional: 46, unknown unconditional: 1691] , Statistics on independence cache: Total cache size (in pairs): 1737, Positive cache size: 1655, Positive conditional cache size: 14, Positive unconditional cache size: 1641, Negative cache size: 82, Negative conditional cache size: 32, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8840, Maximal queried relation: 6, Independence queries for same thread: 28, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 1200, Number of trivial persistent sets: 381, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1691, independent: 1641, independent conditional: 0, independent unconditional: 1641, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10240, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 183, dependent conditional: 133, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10212, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 155, dependent conditional: 105, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10212, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 155, dependent conditional: 105, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 8416, independent unconditional: 1641, dependent: 828, dependent conditional: 778, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 79, independent unconditional: 9978, dependent: 828, dependent conditional: 275, dependent unconditional: 553, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10885, independent: 10057, independent conditional: 79, independent unconditional: 9978, dependent: 828, dependent conditional: 275, dependent unconditional: 553, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1737, independent: 1655, independent conditional: 14, independent unconditional: 1641, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1737, independent: 1624, independent conditional: 0, independent unconditional: 1624, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 113, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 82, dependent conditional: 32, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 685, independent: 185, independent conditional: 31, independent unconditional: 154, dependent: 499, dependent conditional: 153, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10885, independent: 8402, independent conditional: 65, independent unconditional: 8337, dependent: 746, dependent conditional: 243, dependent unconditional: 503, unknown: 1737, unknown conditional: 46, unknown unconditional: 1691] , Statistics on independence cache: Total cache size (in pairs): 1737, Positive cache size: 1655, Positive conditional cache size: 14, Positive unconditional cache size: 1641, Negative cache size: 82, Negative conditional cache size: 32, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8840, Maximal queried relation: 6, Independence queries for same thread: 28 - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L745] 2 return 0; [L714] CALL 3 __VERIFIER_atomic_take_write_lock() [L706] CALL 3 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 3 !(!cond) [L706] RET 3 assume_abort_if_not(w==0 && r==0) [L707] 3 w = 1 [L714] RET 3 __VERIFIER_atomic_take_write_lock() [L716] 3 x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 76 locations, 80 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 54, 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, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 10:51:04,061 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...