/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/lazy01.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:53:46,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:53:46,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 16:53:46,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:53:46,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:53:46,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:53:46,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:53:46,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:53:46,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:53:46,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:53:46,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:53:46,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:53:46,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:53:46,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:53:46,267 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:53:46,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:53:46,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:46,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:46,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:46,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:53:46,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 16:53:46,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:53:46,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:53:46,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:53:46,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:53:46,510 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:53:46,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/lazy01.i [2025-04-13 16:53:47,821 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9629a9439/9b45b456a1774757838bb881c2c95441/FLAG91f87e03d [2025-04-13 16:53:48,073 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:53:48,074 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/lazy01.i [2025-04-13 16:53:48,084 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9629a9439/9b45b456a1774757838bb881c2c95441/FLAG91f87e03d [2025-04-13 16:53:48,871 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9629a9439/9b45b456a1774757838bb881c2c95441 [2025-04-13 16:53:48,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:53:48,874 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:53:48,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:48,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:53:48,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:53:48,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:48" (1/1) ... [2025-04-13 16:53:48,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34697553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:48, skipping insertion in model container [2025-04-13 16:53:48,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:48" (1/1) ... [2025-04-13 16:53:48,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:53:49,144 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/lazy01.i[31042,31055] [2025-04-13 16:53:49,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:49,165 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:53:49,208 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/lazy01.i[31042,31055] [2025-04-13 16:53:49,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:49,243 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:53:49,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49 WrapperNode [2025-04-13 16:53:49,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:49,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:49,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:53:49,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:53:49,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,278 INFO L138 Inliner]: procedures = 169, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-04-13 16:53:49,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:49,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:53:49,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:53:49,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:53:49,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,298 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 16:53:49,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:53:49,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:53:49,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:53:49,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:53:49,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:49,333 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-13 16:53:49,335 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-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 16:53:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 16:53:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 16:53:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:53:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:53:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 16:53:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 16:53:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:53:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:53:49,352 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:53:49,446 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:53:49,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:53:49,548 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:53:49,549 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:53:49,549 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:53:49,634 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:53:49,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:49 BoogieIcfgContainer [2025-04-13 16:53:49,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:53:49,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:53:49,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:53:49,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:53:49,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:53:48" (1/3) ... [2025-04-13 16:53:49,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f68e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:49, skipping insertion in model container [2025-04-13 16:53:49,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (2/3) ... [2025-04-13 16:53:49,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f68e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:49, skipping insertion in model container [2025-04-13 16:53:49,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:49" (3/3) ... [2025-04-13 16:53:49,641 INFO L128 eAbstractionObserver]: Analyzing ICFG lazy01.i [2025-04-13 16:53:49,650 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:53:49,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lazy01.i that has 4 procedures, 31 locations, 27 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 16:53:49,651 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:53:49,693 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 16:53:49,712 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 30 transitions, 81 flow [2025-04-13 16:53:49,754 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 402 states, 401 states have (on average 2.8054862842892767) internal successors, (1125), 401 states have internal predecessors, (1125), 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-13 16:53:49,771 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:53:49,778 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=FINITE_AUTOMATA, 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;@447bdcf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:53:49,778 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 16:53:49,780 INFO L278 IsEmpty]: Start isEmpty. Operand has 402 states, 401 states have (on average 2.8054862842892767) internal successors, (1125), 401 states have internal predecessors, (1125), 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-13 16:53:49,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 16:53:49,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:49,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:49,785 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:53:49,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1496274049, now seen corresponding path program 1 times [2025-04-13 16:53:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:49,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746530950] [2025-04-13 16:53:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:49,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 16:53:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 16:53:49,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,020 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-13 16:53:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746530950] [2025-04-13 16:53:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746530950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:53:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891145666] [2025-04-13 16:53:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:50,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:50,041 INFO L87 Difference]: Start difference. First operand has 402 states, 401 states have (on average 2.8054862842892767) internal successors, (1125), 401 states have internal predecessors, (1125), 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) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 16:53:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,113 INFO L93 Difference]: Finished difference Result 463 states and 1248 transitions. [2025-04-13 16:53:50,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:50,115 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2025-04-13 16:53:50,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,123 INFO L225 Difference]: With dead ends: 463 [2025-04-13 16:53:50,124 INFO L226 Difference]: Without dead ends: 384 [2025-04-13 16:53:50,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:50,128 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-13 16:53:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-04-13 16:53:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.772845953002611) internal successors, (1062), 383 states have internal predecessors, (1062), 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-13 16:53:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1062 transitions. [2025-04-13 16:53:50,186 INFO L79 Accepts]: Start accepts. Automaton has 384 states and 1062 transitions. Word has length 9 [2025-04-13 16:53:50,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,187 INFO L485 AbstractCegarLoop]: Abstraction has 384 states and 1062 transitions. [2025-04-13 16:53:50,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 16:53:50,188 INFO L278 IsEmpty]: Start isEmpty. Operand 384 states and 1062 transitions. [2025-04-13 16:53:50,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 16:53:50,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:53:50,190 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:53:50,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1868305125, now seen corresponding path program 1 times [2025-04-13 16:53:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:50,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067459169] [2025-04-13 16:53:50,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:50,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:50,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,335 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-13 16:53:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067459169] [2025-04-13 16:53:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067459169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:50,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:50,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:53:50,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51135078] [2025-04-13 16:53:50,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:50,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:50,337 INFO L87 Difference]: Start difference. First operand 384 states and 1062 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 16:53:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,397 INFO L93 Difference]: Finished difference Result 524 states and 1413 transitions. [2025-04-13 16:53:50,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:50,397 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2025-04-13 16:53:50,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,399 INFO L225 Difference]: With dead ends: 524 [2025-04-13 16:53:50,399 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 16:53:50,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:50,400 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 16:53:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-04-13 16:53:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 275 states have (on average 2.4690909090909092) internal successors, (679), 277 states have internal predecessors, (679), 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-13 16:53:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 679 transitions. [2025-04-13 16:53:50,409 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 679 transitions. Word has length 12 [2025-04-13 16:53:50,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,409 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 679 transitions. [2025-04-13 16:53:50,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 16:53:50,409 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 679 transitions. [2025-04-13 16:53:50,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 16:53:50,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 16:53:50,410 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:53:50,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -33681469, now seen corresponding path program 1 times [2025-04-13 16:53:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:50,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676792219] [2025-04-13 16:53:50,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 16:53:50,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 16:53:50,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,474 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-13 16:53:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676792219] [2025-04-13 16:53:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676792219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 16:53:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357994560] [2025-04-13 16:53:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 16:53:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 16:53:50,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:50,475 INFO L87 Difference]: Start difference. First operand 278 states and 679 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 16:53:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,517 INFO L93 Difference]: Finished difference Result 278 states and 679 transitions. [2025-04-13 16:53:50,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 16:53:50,517 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2025-04-13 16:53:50,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,519 INFO L225 Difference]: With dead ends: 278 [2025-04-13 16:53:50,519 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 16:53:50,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:50,520 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 16:53:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-04-13 16:53:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 2.45703125) internal successors, (629), 257 states have internal predecessors, (629), 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-13 16:53:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 629 transitions. [2025-04-13 16:53:50,532 INFO L79 Accepts]: Start accepts. Automaton has 258 states and 629 transitions. Word has length 13 [2025-04-13 16:53:50,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,532 INFO L485 AbstractCegarLoop]: Abstraction has 258 states and 629 transitions. [2025-04-13 16:53:50,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 16:53:50,532 INFO L278 IsEmpty]: Start isEmpty. Operand 258 states and 629 transitions. [2025-04-13 16:53:50,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 16:53:50,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 16:53:50,535 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:53:50,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -968438013, now seen corresponding path program 1 times [2025-04-13 16:53:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:50,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008270490] [2025-04-13 16:53:50,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 16:53:50,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 16:53:50,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,583 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-13 16:53:50,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008270490] [2025-04-13 16:53:50,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008270490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:50,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:50,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 16:53:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349963284] [2025-04-13 16:53:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 16:53:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 16:53:50,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:50,585 INFO L87 Difference]: Start difference. First operand 258 states and 629 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 16:53:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,637 INFO L93 Difference]: Finished difference Result 258 states and 629 transitions. [2025-04-13 16:53:50,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 16:53:50,637 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2025-04-13 16:53:50,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,639 INFO L225 Difference]: With dead ends: 258 [2025-04-13 16:53:50,639 INFO L226 Difference]: Without dead ends: 242 [2025-04-13 16:53:50,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:50,640 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-04-13 16:53:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-04-13 16:53:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.4439834024896268) internal successors, (589), 241 states have internal predecessors, (589), 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-13 16:53:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 589 transitions. [2025-04-13 16:53:50,652 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 589 transitions. Word has length 13 [2025-04-13 16:53:50,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,652 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 589 transitions. [2025-04-13 16:53:50,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 16:53:50,653 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 589 transitions. [2025-04-13 16:53:50,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 16:53:50,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 16:53:50,653 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:53:50,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1562240699, now seen corresponding path program 1 times [2025-04-13 16:53:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:50,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737691992] [2025-04-13 16:53:50,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 16:53:50,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 16:53:50,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:53:50,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 16:53:50,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 16:53:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 16:53:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:53:50,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 16:53:50,712 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 16:53:50,713 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 16:53:50,714 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 16:53:50,714 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 16:53:50,714 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 16:53:50,714 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 16:53:50,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 16:53:50,716 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 16:53:50,756 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 16:53:50,756 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 16:53:50,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:53:50 BasicIcfg [2025-04-13 16:53:50,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 16:53:50,761 INFO L158 Benchmark]: Toolchain (without parser) took 1886.44ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 94.5MB in the end (delta: 5.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2025-04-13 16:53:50,761 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 16:53:50,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.58ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 77.6MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 16:53:50,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.55ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 75.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 16:53:50,763 INFO L158 Benchmark]: Boogie Preprocessor took 29.34ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 16:53:50,763 INFO L158 Benchmark]: RCFGBuilder took 325.86ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 49.2MB in the end (delta: 24.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 16:53:50,763 INFO L158 Benchmark]: TraceAbstraction took 1123.61ms. Allocated memory is still 142.6MB. Free memory was 48.3MB in the beginning and 94.5MB in the end (delta: -46.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 16:53:50,764 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.21ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.58ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 77.6MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.55ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 75.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.34ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 325.86ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 49.2MB in the end (delta: 24.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1123.61ms. Allocated memory is still 142.6MB. Free memory was 48.3MB in the beginning and 94.5MB in the end (delta: -46.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, data=0, mutex={3:0}, t1=-1] [L707] 1 data++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, data=1, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, data=1, mutex={3:0}, t1=-1, t2=0, t3=1] [L714] 2 data+=2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] 3 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 53 locations, 52 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 15 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred 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: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 16:53:50,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...