/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/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:48:13,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:48:13,537 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 23:48:13,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:48:13,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:48:13,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:48:13,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:48:13,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:48:13,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:48:13,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:48:13,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:48:13,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:48:13,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:48:13,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:48:13,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:48:13,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:13,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:13,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:48:13,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:48:13,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:48:13,565 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-13 23:48:13,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:48:13,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:48:13,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:48:13,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:48:13,798 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:48:13,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2025-04-13 23:48:15,097 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebae13f1/06e5fe0fbb264bf0abfa7d81082dc448/FLAG60340da01 [2025-04-13 23:48:15,319 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:48:15,319 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2025-04-13 23:48:15,329 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebae13f1/06e5fe0fbb264bf0abfa7d81082dc448/FLAG60340da01 [2025-04-13 23:48:16,148 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebae13f1/06e5fe0fbb264bf0abfa7d81082dc448 [2025-04-13 23:48:16,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:48:16,151 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:48:16,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:16,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:48:16,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:48:16,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4491fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16, skipping insertion in model container [2025-04-13 23:48:16,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:48:16,480 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/triangular-2.i[30952,30965] [2025-04-13 23:48:16,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:16,490 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:48:16,546 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/triangular-2.i[30952,30965] [2025-04-13 23:48:16,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:16,566 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:48:16,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16 WrapperNode [2025-04-13 23:48:16,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:16,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:16,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:48:16,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:48:16,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,592 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 23:48:16,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:16,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:48:16,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:48:16,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:48:16,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,607 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-13 23:48:16,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:48:16,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:48:16,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:48:16,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:48:16,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (1/1) ... [2025-04-13 23:48:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:16,646 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 23:48:16,648 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 23:48:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:48:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:48:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:48:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:48:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:48:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:48:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:48:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:48:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:48:16,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:48:16,665 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:48:16,753 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:48:16,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:48:16,845 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:48:16,845 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:48:16,845 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:48:16,916 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:16,921 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:16,924 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:48:16,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:16 BoogieIcfgContainer [2025-04-13 23:48:16,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:48:16,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:48:16,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:48:16,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:48:16,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:48:16" (1/3) ... [2025-04-13 23:48:16,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74296c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:16, skipping insertion in model container [2025-04-13 23:48:16,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:16" (2/3) ... [2025-04-13 23:48:16,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74296c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:16, skipping insertion in model container [2025-04-13 23:48:16,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:16" (3/3) ... [2025-04-13 23:48:16,935 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-04-13 23:48:16,946 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:48:16,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:48:16,947 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:48:16,975 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:48:16,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:17,012 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 23:48:17,014 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:17,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 4/19 cut-off events. For 0/0 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 19. Up to 2 conditions per place. [2025-04-13 23:48:17,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:17,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 44 flow [2025-04-13 23:48:17,025 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:48:17,034 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;@6d8eb2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:48:17,034 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:48:17,041 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:48:17,041 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 23:48:17,041 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:17,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:17,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:17,042 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:17,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -272227646, now seen corresponding path program 1 times [2025-04-13 23:48:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:17,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181777878] [2025-04-13 23:48:17,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:48:17,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:48:17,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:17,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:17,336 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 23:48:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:17,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181777878] [2025-04-13 23:48:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181777878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:48:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449556397] [2025-04-13 23:48:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:17,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:48:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:48:17,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:48:17,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:17,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 23:48:17,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:17,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:17,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:17,564 INFO L116 PetriNetUnfolderBase]: 237/370 cut-off events. [2025-04-13 23:48:17,564 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 23:48:17,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 370 events. 237/370 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 45 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 744. Up to 233 conditions per place. [2025-04-13 23:48:17,575 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 25 selfloop transitions, 4 changer transitions 17/46 dead transitions. [2025-04-13 23:48:17,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 46 transitions, 190 flow [2025-04-13 23:48:17,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:48:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:48:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 23:48:17,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-04-13 23:48:17,591 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 44 flow. Second operand 6 states and 68 transitions. [2025-04-13 23:48:17,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 46 transitions, 190 flow [2025-04-13 23:48:17,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:17,596 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 65 flow [2025-04-13 23:48:17,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2025-04-13 23:48:17,600 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-04-13 23:48:17,600 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 65 flow [2025-04-13 23:48:17,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 23:48:17,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:17,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:17,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:48:17,601 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:17,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash 396254466, now seen corresponding path program 1 times [2025-04-13 23:48:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:17,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264743910] [2025-04-13 23:48:17,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:17,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:17,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:17,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:17,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:17,745 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 23:48:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:17,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264743910] [2025-04-13 23:48:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264743910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918096021] [2025-04-13 23:48:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:17,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:17,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:17,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:17,747 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:17,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 65 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-13 23:48:17,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:17,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:17,952 INFO L116 PetriNetUnfolderBase]: 295/480 cut-off events. [2025-04-13 23:48:17,952 INFO L117 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2025-04-13 23:48:17,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 480 events. 295/480 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1650 event pairs, 41 based on Foata normal form. 24/418 useless extension candidates. Maximal degree in co-relation 1169. Up to 219 conditions per place. [2025-04-13 23:48:17,957 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 43 selfloop transitions, 9 changer transitions 19/71 dead transitions. [2025-04-13 23:48:17,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 357 flow [2025-04-13 23:48:17,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 23:48:17,961 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-13 23:48:17,961 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 65 flow. Second operand 9 states and 86 transitions. [2025-04-13 23:48:17,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 357 flow [2025-04-13 23:48:17,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 71 transitions, 341 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:17,966 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 150 flow [2025-04-13 23:48:17,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-04-13 23:48:17,966 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2025-04-13 23:48:17,967 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 150 flow [2025-04-13 23:48:17,967 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-13 23:48:17,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:17,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:17,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:48:17,967 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:17,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash 396744576, now seen corresponding path program 2 times [2025-04-13 23:48:17,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:17,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43141784] [2025-04-13 23:48:17,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:17,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:17,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:17,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:18,111 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 23:48:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:18,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43141784] [2025-04-13 23:48:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43141784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:18,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891019990] [2025-04-13 23:48:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:18,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:18,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:18,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:18,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:18,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 150 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-13 23:48:18,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:18,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:18,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:18,257 INFO L116 PetriNetUnfolderBase]: 256/429 cut-off events. [2025-04-13 23:48:18,258 INFO L117 PetriNetUnfolderBase]: For 743/743 co-relation queries the response was YES. [2025-04-13 23:48:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 429 events. 256/429 cut-off events. For 743/743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1515 event pairs, 41 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1329. Up to 208 conditions per place. [2025-04-13 23:48:18,260 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 9 changer transitions 25/72 dead transitions. [2025-04-13 23:48:18,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 478 flow [2025-04-13 23:48:18,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:48:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:48:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-04-13 23:48:18,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-13 23:48:18,262 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 150 flow. Second operand 8 states and 76 transitions. [2025-04-13 23:48:18,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 478 flow [2025-04-13 23:48:18,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 470 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:18,265 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 204 flow [2025-04-13 23:48:18,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-04-13 23:48:18,265 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2025-04-13 23:48:18,265 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 204 flow [2025-04-13 23:48:18,266 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-13 23:48:18,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:18,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:18,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:48:18,266 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:18,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1129004876, now seen corresponding path program 1 times [2025-04-13 23:48:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:18,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628090987] [2025-04-13 23:48:18,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:18,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:18,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:18,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:18,377 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 23:48:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:18,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628090987] [2025-04-13 23:48:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628090987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250283853] [2025-04-13 23:48:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:18,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:18,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:18,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:18,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:18,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:18,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:18,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:18,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:18,571 INFO L116 PetriNetUnfolderBase]: 274/453 cut-off events. [2025-04-13 23:48:18,571 INFO L117 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2025-04-13 23:48:18,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 453 events. 274/453 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1584 event pairs, 53 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 1557. Up to 211 conditions per place. [2025-04-13 23:48:18,574 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 46 selfloop transitions, 16 changer transitions 17/79 dead transitions. [2025-04-13 23:48:18,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 573 flow [2025-04-13 23:48:18,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2025-04-13 23:48:18,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-04-13 23:48:18,575 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 204 flow. Second operand 11 states and 95 transitions. [2025-04-13 23:48:18,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 573 flow [2025-04-13 23:48:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 506 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-04-13 23:48:18,579 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 273 flow [2025-04-13 23:48:18,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=273, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-04-13 23:48:18,580 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2025-04-13 23:48:18,580 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 273 flow [2025-04-13 23:48:18,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:18,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:18,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:18,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:48:18,580 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:18,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1124046116, now seen corresponding path program 2 times [2025-04-13 23:48:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:18,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158123312] [2025-04-13 23:48:18,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:18,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:18,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:18,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:18,666 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 23:48:18,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:18,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158123312] [2025-04-13 23:48:18,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158123312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:18,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385390178] [2025-04-13 23:48:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:18,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:18,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:18,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:18,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:18,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:18,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:18,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:18,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:18,849 INFO L116 PetriNetUnfolderBase]: 445/732 cut-off events. [2025-04-13 23:48:18,849 INFO L117 PetriNetUnfolderBase]: For 2713/2713 co-relation queries the response was YES. [2025-04-13 23:48:18,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 732 events. 445/732 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2894 event pairs, 31 based on Foata normal form. 27/597 useless extension candidates. Maximal degree in co-relation 2638. Up to 253 conditions per place. [2025-04-13 23:48:18,854 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 57 selfloop transitions, 20 changer transitions 21/98 dead transitions. [2025-04-13 23:48:18,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 757 flow [2025-04-13 23:48:18,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-04-13 23:48:18,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2025-04-13 23:48:18,855 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 273 flow. Second operand 11 states and 106 transitions. [2025-04-13 23:48:18,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 757 flow [2025-04-13 23:48:18,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 691 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:18,865 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 370 flow [2025-04-13 23:48:18,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=370, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2025-04-13 23:48:18,865 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 40 predicate places. [2025-04-13 23:48:18,865 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 370 flow [2025-04-13 23:48:18,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:18,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:18,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:18,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:48:18,866 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:18,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1898509928, now seen corresponding path program 3 times [2025-04-13 23:48:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:18,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832879841] [2025-04-13 23:48:18,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:18,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:18,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:18,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:48:18,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:18,948 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 23:48:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:18,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832879841] [2025-04-13 23:48:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832879841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039633736] [2025-04-13 23:48:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:18,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:18,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:18,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:18,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:18,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:18,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:18,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:18,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:19,154 INFO L116 PetriNetUnfolderBase]: 418/696 cut-off events. [2025-04-13 23:48:19,154 INFO L117 PetriNetUnfolderBase]: For 4269/4269 co-relation queries the response was YES. [2025-04-13 23:48:19,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 696 events. 418/696 cut-off events. For 4269/4269 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2723 event pairs, 37 based on Foata normal form. 45/585 useless extension candidates. Maximal degree in co-relation 2917. Up to 154 conditions per place. [2025-04-13 23:48:19,158 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 45 selfloop transitions, 25 changer transitions 31/101 dead transitions. [2025-04-13 23:48:19,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 950 flow [2025-04-13 23:48:19,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2025-04-13 23:48:19,164 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-04-13 23:48:19,164 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 370 flow. Second operand 11 states and 103 transitions. [2025-04-13 23:48:19,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 950 flow [2025-04-13 23:48:19,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 879 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-13 23:48:19,172 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 469 flow [2025-04-13 23:48:19,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=469, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2025-04-13 23:48:19,173 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2025-04-13 23:48:19,173 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 469 flow [2025-04-13 23:48:19,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:19,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:19,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:19,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:48:19,174 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:19,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 599557581, now seen corresponding path program 1 times [2025-04-13 23:48:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:19,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529435024] [2025-04-13 23:48:19,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:19,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:19,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:19,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:19,265 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-13 23:48:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:19,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529435024] [2025-04-13 23:48:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529435024] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:19,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346411783] [2025-04-13 23:48:19,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:19,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:19,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:19,268 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-13 23:48:19,269 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-13 23:48:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:19,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:19,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:48:19,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:19,377 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-13 23:48:19,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:19,491 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-13 23:48:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346411783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:19,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:48:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664988602] [2025-04-13 23:48:19,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:19,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:19,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:19,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:19,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 469 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 23:48:19,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:19,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:19,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:19,838 INFO L116 PetriNetUnfolderBase]: 526/876 cut-off events. [2025-04-13 23:48:19,838 INFO L117 PetriNetUnfolderBase]: For 9194/9194 co-relation queries the response was YES. [2025-04-13 23:48:19,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 876 events. 526/876 cut-off events. For 9194/9194 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3223 event pairs, 125 based on Foata normal form. 63/735 useless extension candidates. Maximal degree in co-relation 4223. Up to 489 conditions per place. [2025-04-13 23:48:19,844 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 67 selfloop transitions, 17 changer transitions 64/148 dead transitions. [2025-04-13 23:48:19,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 1529 flow [2025-04-13 23:48:19,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:48:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 23:48:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2025-04-13 23:48:19,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 23:48:19,845 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 469 flow. Second operand 19 states and 171 transitions. [2025-04-13 23:48:19,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 1529 flow [2025-04-13 23:48:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 148 transitions, 1430 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-04-13 23:48:19,855 INFO L231 Difference]: Finished difference. Result has 90 places, 51 transitions, 598 flow [2025-04-13 23:48:19,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=598, PETRI_PLACES=90, PETRI_TRANSITIONS=51} [2025-04-13 23:48:19,856 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 68 predicate places. [2025-04-13 23:48:19,856 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 51 transitions, 598 flow [2025-04-13 23:48:19,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 23:48:19,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:19,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:19,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:20,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:20,057 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:20,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1470018493, now seen corresponding path program 2 times [2025-04-13 23:48:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:20,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599875686] [2025-04-13 23:48:20,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:20,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:48:20,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:20,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:20,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:20,136 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-13 23:48:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:20,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599875686] [2025-04-13 23:48:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599875686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:20,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716244317] [2025-04-13 23:48:20,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:20,138 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-13 23:48:20,140 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-13 23:48:20,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:48:20,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:20,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:20,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:20,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:20,219 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-13 23:48:20,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:20,305 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-13 23:48:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716244317] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:20,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:48:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899771375] [2025-04-13 23:48:20,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:20,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:20,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:20,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:20,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:20,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 51 transitions, 598 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 23:48:20,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:20,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:20,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:20,840 INFO L116 PetriNetUnfolderBase]: 814/1353 cut-off events. [2025-04-13 23:48:20,840 INFO L117 PetriNetUnfolderBase]: For 33785/33785 co-relation queries the response was YES. [2025-04-13 23:48:20,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 1353 events. 814/1353 cut-off events. For 33785/33785 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5685 event pairs, 51 based on Foata normal form. 72/1095 useless extension candidates. Maximal degree in co-relation 8618. Up to 304 conditions per place. [2025-04-13 23:48:20,848 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 88 selfloop transitions, 47 changer transitions 74/209 dead transitions. [2025-04-13 23:48:20,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2776 flow [2025-04-13 23:48:20,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:48:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 23:48:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2025-04-13 23:48:20,850 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43562610229276894 [2025-04-13 23:48:20,850 INFO L175 Difference]: Start difference. First operand has 90 places, 51 transitions, 598 flow. Second operand 27 states and 247 transitions. [2025-04-13 23:48:20,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2776 flow [2025-04-13 23:48:20,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 209 transitions, 2232 flow, removed 261 selfloop flow, removed 12 redundant places. [2025-04-13 23:48:20,874 INFO L231 Difference]: Finished difference. Result has 116 places, 67 transitions, 1001 flow [2025-04-13 23:48:20,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1001, PETRI_PLACES=116, PETRI_TRANSITIONS=67} [2025-04-13 23:48:20,875 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 94 predicate places. [2025-04-13 23:48:20,875 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 67 transitions, 1001 flow [2025-04-13 23:48:20,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 23:48:20,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:20,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:20,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:21,081 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,SelfDestructingSolverStorable7 [2025-04-13 23:48:21,081 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:21,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash -892279348, now seen corresponding path program 1 times [2025-04-13 23:48:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:21,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729212989] [2025-04-13 23:48:21,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:21,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:48:21,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:21,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:21,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729212989] [2025-04-13 23:48:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729212989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:21,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984623564] [2025-04-13 23:48:21,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:21,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:21,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:48:21,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:48:21,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:21,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:21,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:21,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:21,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:21,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984623564] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:21,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:48:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378598379] [2025-04-13 23:48:21,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:21,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:48:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:21,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:48:21,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:48:21,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:21,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 67 transitions, 1001 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:21,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:21,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:21,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:21,916 INFO L116 PetriNetUnfolderBase]: 1048/1758 cut-off events. [2025-04-13 23:48:21,917 INFO L117 PetriNetUnfolderBase]: For 80896/80896 co-relation queries the response was YES. [2025-04-13 23:48:21,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13918 conditions, 1758 events. 1048/1758 cut-off events. For 80896/80896 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7962 event pairs, 131 based on Foata normal form. 63/1377 useless extension candidates. Maximal degree in co-relation 13860. Up to 490 conditions per place. [2025-04-13 23:48:21,933 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 99 selfloop transitions, 51 changer transitions 65/215 dead transitions. [2025-04-13 23:48:21,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 215 transitions, 3605 flow [2025-04-13 23:48:21,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:48:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 23:48:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 232 transitions. [2025-04-13 23:48:21,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4419047619047619 [2025-04-13 23:48:21,935 INFO L175 Difference]: Start difference. First operand has 116 places, 67 transitions, 1001 flow. Second operand 25 states and 232 transitions. [2025-04-13 23:48:21,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 215 transitions, 3605 flow [2025-04-13 23:48:21,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 215 transitions, 3025 flow, removed 274 selfloop flow, removed 15 redundant places. [2025-04-13 23:48:21,994 INFO L231 Difference]: Finished difference. Result has 132 places, 78 transitions, 1287 flow [2025-04-13 23:48:21,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1287, PETRI_PLACES=132, PETRI_TRANSITIONS=78} [2025-04-13 23:48:21,995 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2025-04-13 23:48:21,995 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 78 transitions, 1287 flow [2025-04-13 23:48:21,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:21,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:21,995 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:22,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:48:22,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:22,196 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:22,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 958544518, now seen corresponding path program 2 times [2025-04-13 23:48:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:22,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728050325] [2025-04-13 23:48:22,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:22,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:48:22,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:22,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:22,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:22,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728050325] [2025-04-13 23:48:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728050325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:22,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174434714] [2025-04-13 23:48:22,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:22,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:22,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:48:22,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:48:22,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:22,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:22,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:48:22,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:22,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174434714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:22,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:48:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111248011] [2025-04-13 23:48:22,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:22,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:48:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:22,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:48:22,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:48:22,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:22,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 78 transitions, 1287 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:22,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:22,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:23,067 INFO L116 PetriNetUnfolderBase]: 1165/1992 cut-off events. [2025-04-13 23:48:23,068 INFO L117 PetriNetUnfolderBase]: For 130170/130170 co-relation queries the response was YES. [2025-04-13 23:48:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16911 conditions, 1992 events. 1165/1992 cut-off events. For 130170/130170 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9283 event pairs, 43 based on Foata normal form. 135/1605 useless extension candidates. Maximal degree in co-relation 16846. Up to 490 conditions per place. [2025-04-13 23:48:23,083 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 89 selfloop transitions, 76 changer transitions 96/261 dead transitions. [2025-04-13 23:48:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 261 transitions, 5143 flow [2025-04-13 23:48:23,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 23:48:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 23:48:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 259 transitions. [2025-04-13 23:48:23,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-04-13 23:48:23,085 INFO L175 Difference]: Start difference. First operand has 132 places, 78 transitions, 1287 flow. Second operand 28 states and 259 transitions. [2025-04-13 23:48:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 261 transitions, 5143 flow [2025-04-13 23:48:23,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 261 transitions, 4380 flow, removed 348 selfloop flow, removed 18 redundant places. [2025-04-13 23:48:23,182 INFO L231 Difference]: Finished difference. Result has 153 places, 99 transitions, 1922 flow [2025-04-13 23:48:23,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1922, PETRI_PLACES=153, PETRI_TRANSITIONS=99} [2025-04-13 23:48:23,186 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 131 predicate places. [2025-04-13 23:48:23,187 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 99 transitions, 1922 flow [2025-04-13 23:48:23,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:23,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:23,187 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:23,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:48:23,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:23,388 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:23,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 13680550, now seen corresponding path program 3 times [2025-04-13 23:48:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:23,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716983178] [2025-04-13 23:48:23,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:23,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 23:48:23,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:48:23,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:48:23,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:23,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716983178] [2025-04-13 23:48:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716983178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:23,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085070821] [2025-04-13 23:48:23,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:23,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:23,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:48:23,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 23:48:23,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:48:23,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:48:23,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:23,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 23:48:23,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:23,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085070821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:23,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-04-13 23:48:23,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518536123] [2025-04-13 23:48:23,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:23,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:48:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:23,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:48:23,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:48:23,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:23,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 99 transitions, 1922 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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 23:48:23,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:23,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:23,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:24,511 INFO L116 PetriNetUnfolderBase]: 1381/2325 cut-off events. [2025-04-13 23:48:24,512 INFO L117 PetriNetUnfolderBase]: For 192031/192031 co-relation queries the response was YES. [2025-04-13 23:48:24,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21503 conditions, 2325 events. 1381/2325 cut-off events. For 192031/192031 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10551 event pairs, 19 based on Foata normal form. 54/1779 useless extension candidates. Maximal degree in co-relation 21428. Up to 562 conditions per place. [2025-04-13 23:48:24,562 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 114 selfloop transitions, 100 changer transitions 85/299 dead transitions. [2025-04-13 23:48:24,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 299 transitions, 6288 flow [2025-04-13 23:48:24,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:48:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 23:48:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 309 transitions. [2025-04-13 23:48:24,565 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4327731092436975 [2025-04-13 23:48:24,565 INFO L175 Difference]: Start difference. First operand has 153 places, 99 transitions, 1922 flow. Second operand 34 states and 309 transitions. [2025-04-13 23:48:24,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 299 transitions, 6288 flow [2025-04-13 23:48:24,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 299 transitions, 5207 flow, removed 514 selfloop flow, removed 18 redundant places. [2025-04-13 23:48:24,696 INFO L231 Difference]: Finished difference. Result has 176 places, 121 transitions, 2469 flow [2025-04-13 23:48:24,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2469, PETRI_PLACES=176, PETRI_TRANSITIONS=121} [2025-04-13 23:48:24,697 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 154 predicate places. [2025-04-13 23:48:24,697 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 121 transitions, 2469 flow [2025-04-13 23:48:24,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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 23:48:24,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:24,697 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:24,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:24,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:48:24,898 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:24,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -938546766, now seen corresponding path program 4 times [2025-04-13 23:48:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:24,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167107876] [2025-04-13 23:48:24,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:24,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:48:24,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:48:24,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:48:24,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:48:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:48:24,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:48:24,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:24,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:48:24,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:48:24,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:48:24,936 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:48:24,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:48:24,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:48:24,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:48:24,938 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-04-13 23:48:24,996 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:48:24,996 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:48:25,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:48:25 BasicIcfg [2025-04-13 23:48:25,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:48:25,004 INFO L158 Benchmark]: Toolchain (without parser) took 8853.11ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 98.3MB in the beginning and 201.5MB in the end (delta: -103.2MB). Peak memory consumption was 77.2MB. Max. memory is 8.0GB. [2025-04-13 23:48:25,004 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:48:25,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.49ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 75.5MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:48:25,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.29ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 74.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:48:25,005 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:48:25,005 INFO L158 Benchmark]: IcfgBuilder took 307.26ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 51.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:48:25,005 INFO L158 Benchmark]: TraceAbstraction took 8074.38ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 51.0MB in the beginning and 201.5MB in the end (delta: -150.5MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2025-04-13 23:48:25,006 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.49ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 75.5MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.29ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 74.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 307.26ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 51.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8074.38ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 51.0MB in the beginning and 201.5MB in the end (delta: -150.5MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:50}, \at(argc, Pre)=51, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=7, id1=-1, id2=0, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 714]: 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: 713]: 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, 28 locations, 33 edges, 3 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: 7.9s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1740 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1740 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2650 IncrementalHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 0 mSDtfsCounter, 2650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2469occurred in iteration=11, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 1234 SizeOfPredicates, 27 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/108 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 23:48:25,019 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...