/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/unwind1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:46:23,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:46:23,614 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-14 01:46:23,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:46:23,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:46:23,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:46:23,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:46:23,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:46:23,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:46:23,635 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:46:23,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:46:23,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:46:23,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:46:23,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:46:23,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:23,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:23,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:46:23,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:46:23,638 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 -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:46:23,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:46:23,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:46:23,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:46:23,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:46:23,866 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:46:23,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind1-1.i [2025-04-14 01:46:25,133 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef18abeb0/29cdb9f7f7be455d917bd98b4bbafbb9/FLAGfba86e6bd [2025-04-14 01:46:25,358 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:46:25,359 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-1.i [2025-04-14 01:46:25,372 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef18abeb0/29cdb9f7f7be455d917bd98b4bbafbb9/FLAGfba86e6bd [2025-04-14 01:46:26,284 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef18abeb0/29cdb9f7f7be455d917bd98b4bbafbb9 [2025-04-14 01:46:26,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:46:26,287 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:46:26,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:26,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:46:26,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:46:26,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bc35a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26, skipping insertion in model container [2025-04-14 01:46:26,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:46:26,572 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-theta/unwind1-1.i[33026,33039] [2025-04-14 01:46:26,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:26,586 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:46:26,624 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-theta/unwind1-1.i[33026,33039] [2025-04-14 01:46:26,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:26,655 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:46:26,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26 WrapperNode [2025-04-14 01:46:26,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:26,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:26,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:46:26,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:46:26,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,683 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-04-14 01:46:26,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:26,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:46:26,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:46:26,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:46:26,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:46:26,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:46:26,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:46:26,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:46:26,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:46:26,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (1/1) ... [2025-04-14 01:46:26,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:26,743 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 01:46:26,745 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 01:46:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:46:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:46:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:46:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:46:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:46:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:46:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:46:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:46:26,760 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:46:26,843 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:46:26,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:46:26,929 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:46:26,930 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:46:26,930 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:46:27,020 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:46:27,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:27 BoogieIcfgContainer [2025-04-14 01:46:27,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:46:27,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:46:27,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:46:27,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:46:27,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:46:26" (1/3) ... [2025-04-14 01:46:27,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4c544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:27, skipping insertion in model container [2025-04-14 01:46:27,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:26" (2/3) ... [2025-04-14 01:46:27,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4c544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:27, skipping insertion in model container [2025-04-14 01:46:27,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:27" (3/3) ... [2025-04-14 01:46:27,029 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-1.i [2025-04-14 01:46:27,037 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:46:27,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-1.i that has 3 procedures, 18 locations, 17 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-14 01:46:27,038 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:46:27,073 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:46:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 52 flow [2025-04-14 01:46:27,115 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-14 01:46:27,117 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:46:27,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-14 01:46:27,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 52 flow [2025-04-14 01:46:27,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 39 flow [2025-04-14 01:46:27,128 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:27,134 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=PETRI_NET, 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;@440910f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:27,135 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:46:27,138 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:27,139 INFO L116 PetriNetUnfolderBase]: 2/12 cut-off events. [2025-04-14 01:46:27,139 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:46:27,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:27,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:27,139 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:27,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 641203627, now seen corresponding path program 1 times [2025-04-14 01:46:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:27,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398761452] [2025-04-14 01:46:27,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:27,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:27,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:27,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:27,394 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 01:46:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:27,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398761452] [2025-04-14 01:46:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398761452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73955701] [2025-04-14 01:46:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:27,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:27,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:27,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:27,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:27,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 39 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 01:46:27,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:27,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:27,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:27,513 INFO L116 PetriNetUnfolderBase]: 102/168 cut-off events. [2025-04-14 01:46:27,513 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 01:46:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 168 events. 102/168 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 463 event pairs, 40 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 320. Up to 103 conditions per place. [2025-04-14 01:46:27,517 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 19 selfloop transitions, 3 changer transitions 2/24 dead transitions. [2025-04-14 01:46:27,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 108 flow [2025-04-14 01:46:27,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-14 01:46:27,526 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-04-14 01:46:27,529 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 39 flow. Second operand 4 states and 33 transitions. [2025-04-14 01:46:27,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 108 flow [2025-04-14 01:46:27,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 24 transitions, 101 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:46:27,535 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 46 flow [2025-04-14 01:46:27,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-04-14 01:46:27,539 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-14 01:46:27,539 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 46 flow [2025-04-14 01:46:27,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 01:46:27,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:27,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:27,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:46:27,540 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:27,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1597523916, now seen corresponding path program 1 times [2025-04-14 01:46:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:27,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800197910] [2025-04-14 01:46:27,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:27,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:46:27,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:46:27,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:27,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800197910] [2025-04-14 01:46:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800197910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:46:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443338076] [2025-04-14 01:46:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:27,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:27,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:27,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:27,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:27,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 01:46:27,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:27,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:27,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:27,696 INFO L116 PetriNetUnfolderBase]: 47/95 cut-off events. [2025-04-14 01:46:27,696 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-14 01:46:27,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 95 events. 47/95 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 243 event pairs, 15 based on Foata normal form. 11/95 useless extension candidates. Maximal degree in co-relation 133. Up to 55 conditions per place. [2025-04-14 01:46:27,697 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 15 selfloop transitions, 3 changer transitions 9/27 dead transitions. [2025-04-14 01:46:27,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 130 flow [2025-04-14 01:46:27,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:46:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:46:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2025-04-14 01:46:27,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-14 01:46:27,699 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 46 flow. Second operand 5 states and 38 transitions. [2025-04-14 01:46:27,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 130 flow [2025-04-14 01:46:27,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 27 transitions, 123 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:46:27,700 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 55 flow [2025-04-14 01:46:27,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2025-04-14 01:46:27,700 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-14 01:46:27,700 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 15 transitions, 55 flow [2025-04-14 01:46:27,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 01:46:27,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:27,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:27,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:46:27,701 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:27,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 377675020, now seen corresponding path program 1 times [2025-04-14 01:46:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:27,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282144451] [2025-04-14 01:46:27,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:27,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:46:27,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:46:27,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:27,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282144451] [2025-04-14 01:46:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282144451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:27,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766050205] [2025-04-14 01:46:27,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:27,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:27,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:46:27,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:46:27,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:46:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:27,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:46:27,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:27,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766050205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:27,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-14 01:46:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899669504] [2025-04-14 01:46:27,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:27,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:46:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:27,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:46:27,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:46:27,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:27,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 55 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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 01:46:27,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:27,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:28,013 INFO L116 PetriNetUnfolderBase]: 41/83 cut-off events. [2025-04-14 01:46:28,013 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-14 01:46:28,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 83 events. 41/83 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 22 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 145. Up to 63 conditions per place. [2025-04-14 01:46:28,014 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2025-04-14 01:46:28,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 117 flow [2025-04-14 01:46:28,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:46:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:46:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2025-04-14 01:46:28,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3473684210526316 [2025-04-14 01:46:28,015 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 55 flow. Second operand 5 states and 33 transitions. [2025-04-14 01:46:28,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 117 flow [2025-04-14 01:46:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 107 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 01:46:28,016 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 63 flow [2025-04-14 01:46:28,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2025-04-14 01:46:28,017 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2025-04-14 01:46:28,017 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 63 flow [2025-04-14 01:46:28,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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 01:46:28,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:28,017 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:28,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:46:28,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:28,219 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:28,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1398621181, now seen corresponding path program 2 times [2025-04-14 01:46:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:28,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259478761] [2025-04-14 01:46:28,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:28,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:46:28,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:28,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259478761] [2025-04-14 01:46:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259478761] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134167194] [2025-04-14 01:46:28,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:28,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:28,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:46:28,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:46:28,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:28,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:28,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:28,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:46:28,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:28,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:46:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134167194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:46:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-14 01:46:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49660662] [2025-04-14 01:46:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:28,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:46:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:28,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:46:28,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:46:28,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:28,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 01:46:28,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:28,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:28,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:28,481 INFO L116 PetriNetUnfolderBase]: 53/114 cut-off events. [2025-04-14 01:46:28,481 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-14 01:46:28,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 114 events. 53/114 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 320 event pairs, 24 based on Foata normal form. 5/110 useless extension candidates. Maximal degree in co-relation 192. Up to 60 conditions per place. [2025-04-14 01:46:28,484 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 15 selfloop transitions, 2 changer transitions 12/29 dead transitions. [2025-04-14 01:46:28,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 161 flow [2025-04-14 01:46:28,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:46:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:46:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-14 01:46:28,486 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2025-04-14 01:46:28,486 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 63 flow. Second operand 6 states and 40 transitions. [2025-04-14 01:46:28,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 161 flow [2025-04-14 01:46:28,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 148 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:46:28,488 INFO L231 Difference]: Finished difference. Result has 29 places, 14 transitions, 60 flow [2025-04-14 01:46:28,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=14} [2025-04-14 01:46:28,488 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-14 01:46:28,489 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 14 transitions, 60 flow [2025-04-14 01:46:28,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 01:46:28,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:28,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:28,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:46:28,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 01:46:28,694 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:46:28,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 566757715, now seen corresponding path program 1 times [2025-04-14 01:46:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:28,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515631378] [2025-04-14 01:46:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:28,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:46:28,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:28,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:28,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:28,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:46:28,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:46:28,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:28,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:28,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:28,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:46:28,725 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:46:28,725 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:46:28,726 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:46:28,727 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:46:28,727 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-14 01:46:28,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:46:28,727 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-14 01:46:28,759 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:46:28,759 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:46:28,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:46:28 BasicIcfg [2025-04-14 01:46:28,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:46:28,765 INFO L158 Benchmark]: Toolchain (without parser) took 2477.92ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 50.8MB in the end (delta: 40.5MB). Peak memory consumption was 38.7MB. Max. memory is 8.0GB. [2025-04-14 01:46:28,766 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:46:28,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.30ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 68.4MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:46:28,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.79ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 66.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:46:28,767 INFO L158 Benchmark]: Boogie Preprocessor took 30.21ms. Allocated memory is still 125.8MB. Free memory was 66.6MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:46:28,768 INFO L158 Benchmark]: IcfgBuilder took 305.87ms. Allocated memory is still 125.8MB. Free memory was 64.9MB in the beginning and 43.0MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:46:28,768 INFO L158 Benchmark]: TraceAbstraction took 1743.57ms. Allocated memory is still 125.8MB. Free memory was 42.6MB in the beginning and 50.8MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:46:28,768 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.14ms. Allocated memory is still 142.6MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.30ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 68.4MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.79ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 66.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.21ms. Allocated memory is still 125.8MB. Free memory was 66.6MB in the beginning and 64.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 305.87ms. Allocated memory is still 125.8MB. Free memory was 64.9MB in the beginning and 43.0MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1743.57ms. Allocated memory is still 125.8MB. Free memory was 42.6MB in the beginning and 50.8MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 1 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\at(arg, Pre)={0:0}, _N=1, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, limit=2] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, limit=2] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, _N=1, arg={0:0}, expression=0, limit=2] - UnprovableResult [Line: 775]: 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: 776]: 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 5 procedures, 29 locations, 32 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 183 SizeOfPredicates, 2 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/10 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-14 01:46:28,780 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...