/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/weaver/parallel-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:56:35,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:56:35,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:56:35,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:56:35,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:56:35,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:56:35,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:56:35,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:56:35,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:56:35,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:56:35,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:56:35,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:56:35,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:56:35,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:56:35,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:56:35,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:35,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:56:35,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:35,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:56:35,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:56:35,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:56:35,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:56:35,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:56:35,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:56:35,905 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:56:35,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2025-04-14 00:56:37,162 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98d175eb/c6299865bf7b4788800523ee47df01d7/FLAGdb96b65f4 [2025-04-14 00:56:37,342 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:56:37,343 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2025-04-14 00:56:37,348 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98d175eb/c6299865bf7b4788800523ee47df01d7/FLAGdb96b65f4 [2025-04-14 00:56:38,363 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98d175eb/c6299865bf7b4788800523ee47df01d7 [2025-04-14 00:56:38,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:56:38,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:56:38,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:56:38,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:56:38,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:56:38,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c47f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38, skipping insertion in model container [2025-04-14 00:56:38,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:56:38,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-04-14 00:56:38,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:56:38,558 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:56:38,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-04-14 00:56:38,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:56:38,592 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:56:38,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38 WrapperNode [2025-04-14 00:56:38,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:56:38,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:56:38,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:56:38,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:56:38,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,625 INFO L138 Inliner]: procedures = 19, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 140 [2025-04-14 00:56:38,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:56:38,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:56:38,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:56:38,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:56:38,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:56:38,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:56:38,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:56:38,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:56:38,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:56:38,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (1/1) ... [2025-04-14 00:56:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:38,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:56:38,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:56:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:56:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:56:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:56:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:56:38,700 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:56:38,762 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:56:38,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:56:38,913 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:56:38,914 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:56:38,914 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:56:39,033 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:56:39,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:56:39 BoogieIcfgContainer [2025-04-14 00:56:39,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:56:39,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:56:39,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:56:39,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:56:39,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:56:38" (1/3) ... [2025-04-14 00:56:39,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128c362b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:56:39, skipping insertion in model container [2025-04-14 00:56:39,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:38" (2/3) ... [2025-04-14 00:56:39,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128c362b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:56:39, skipping insertion in model container [2025-04-14 00:56:39,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:56:39" (3/3) ... [2025-04-14 00:56:39,040 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-04-14 00:56:39,049 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:56:39,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 43 locations, 41 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:56:39,050 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:56:39,094 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:56:39,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 109 flow [2025-04-14 00:56:39,140 INFO L116 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-04-14 00:56:39,141 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:56:39,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 2/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-04-14 00:56:39,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 109 flow [2025-04-14 00:56:39,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 98 flow [2025-04-14 00:56:39,149 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:56:39,158 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;@8f872ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:56:39,158 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:56:39,172 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:56:39,172 INFO L116 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-04-14 00:56:39,172 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:56:39,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:39,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:39,175 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:39,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 35192992, now seen corresponding path program 1 times [2025-04-14 00:56:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:39,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677926782] [2025-04-14 00:56:39,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:39,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:56:39,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:56:39,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:39,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:39,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677926782] [2025-04-14 00:56:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677926782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:39,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:39,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:56:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489403094] [2025-04-14 00:56:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:39,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:56:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:39,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:56:39,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:56:39,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:39,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:39,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:39,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:39,825 INFO L116 PetriNetUnfolderBase]: 2360/3478 cut-off events. [2025-04-14 00:56:39,825 INFO L117 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-04-14 00:56:39,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7171 conditions, 3478 events. 2360/3478 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16929 event pairs, 1240 based on Foata normal form. 1/3178 useless extension candidates. Maximal degree in co-relation 6647. Up to 1893 conditions per place. [2025-04-14 00:56:39,846 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-04-14 00:56:39,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 280 flow [2025-04-14 00:56:39,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:56:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:56:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-04-14 00:56:39,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-14 00:56:39,860 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 98 flow. Second operand 3 states and 80 transitions. [2025-04-14 00:56:39,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 280 flow [2025-04-14 00:56:39,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:56:39,873 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 111 flow [2025-04-14 00:56:39,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-04-14 00:56:39,877 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-04-14 00:56:39,877 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 111 flow [2025-04-14 00:56:39,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:39,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:39,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:39,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:56:39,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:39,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1441743211, now seen corresponding path program 1 times [2025-04-14 00:56:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:39,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809634347] [2025-04-14 00:56:39,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:39,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:39,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:39,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:39,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:40,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809634347] [2025-04-14 00:56:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809634347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:56:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391447959] [2025-04-14 00:56:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:40,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:56:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:40,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:56:40,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:56:40,022 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:40,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:40,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:40,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:40,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:40,482 INFO L116 PetriNetUnfolderBase]: 4333/6531 cut-off events. [2025-04-14 00:56:40,482 INFO L117 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-04-14 00:56:40,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14016 conditions, 6531 events. 4333/6531 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 36638 event pairs, 1369 based on Foata normal form. 108/6104 useless extension candidates. Maximal degree in co-relation 6910. Up to 2710 conditions per place. [2025-04-14 00:56:40,551 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 94 selfloop transitions, 15 changer transitions 0/112 dead transitions. [2025-04-14 00:56:40,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 112 transitions, 504 flow [2025-04-14 00:56:40,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:56:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:56:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-04-14 00:56:40,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-04-14 00:56:40,553 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-04-14 00:56:40,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 112 transitions, 504 flow [2025-04-14 00:56:40,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 112 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:56:40,555 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 193 flow [2025-04-14 00:56:40,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2025-04-14 00:56:40,557 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-04-14 00:56:40,557 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 193 flow [2025-04-14 00:56:40,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:40,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:40,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:40,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:56:40,557 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:40,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -991510753, now seen corresponding path program 2 times [2025-04-14 00:56:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:40,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015432858] [2025-04-14 00:56:40,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:40,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:40,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:40,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:40,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015432858] [2025-04-14 00:56:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015432858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:56:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401131237] [2025-04-14 00:56:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:40,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:56:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:56:40,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:56:40,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:40,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:40,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:40,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:40,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:40,910 INFO L116 PetriNetUnfolderBase]: 2668/4187 cut-off events. [2025-04-14 00:56:40,910 INFO L117 PetriNetUnfolderBase]: For 1925/1925 co-relation queries the response was YES. [2025-04-14 00:56:40,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10613 conditions, 4187 events. 2668/4187 cut-off events. For 1925/1925 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23424 event pairs, 1641 based on Foata normal form. 0/4123 useless extension candidates. Maximal degree in co-relation 7077. Up to 3525 conditions per place. [2025-04-14 00:56:40,927 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 68 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-04-14 00:56:40,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 422 flow [2025-04-14 00:56:40,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:56:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:56:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-14 00:56:40,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-04-14 00:56:40,929 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 193 flow. Second operand 3 states and 72 transitions. [2025-04-14 00:56:40,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 422 flow [2025-04-14 00:56:40,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:56:40,934 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 212 flow [2025-04-14 00:56:40,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-04-14 00:56:40,935 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-04-14 00:56:40,935 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 212 flow [2025-04-14 00:56:40,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:40,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:40,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:40,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:56:40,936 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:40,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1700630458, now seen corresponding path program 1 times [2025-04-14 00:56:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:40,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933970964] [2025-04-14 00:56:40,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:40,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:40,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:41,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:41,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933970964] [2025-04-14 00:56:41,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933970964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:41,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:41,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:56:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785147896] [2025-04-14 00:56:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:41,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:56:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:41,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:56:41,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:56:41,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:41,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:41,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:41,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:41,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:41,364 INFO L116 PetriNetUnfolderBase]: 2508/4009 cut-off events. [2025-04-14 00:56:41,364 INFO L117 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2025-04-14 00:56:41,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10630 conditions, 4009 events. 2508/4009 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22750 event pairs, 720 based on Foata normal form. 86/4081 useless extension candidates. Maximal degree in co-relation 7333. Up to 1534 conditions per place. [2025-04-14 00:56:41,377 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 78 selfloop transitions, 17 changer transitions 12/110 dead transitions. [2025-04-14 00:56:41,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 110 transitions, 618 flow [2025-04-14 00:56:41,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:56:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:56:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-04-14 00:56:41,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-04-14 00:56:41,379 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 212 flow. Second operand 5 states and 130 transitions. [2025-04-14 00:56:41,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 110 transitions, 618 flow [2025-04-14 00:56:41,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:41,387 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 268 flow [2025-04-14 00:56:41,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2025-04-14 00:56:41,388 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-04-14 00:56:41,388 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 268 flow [2025-04-14 00:56:41,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:41,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:41,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:41,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:56:41,388 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:41,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1096241892, now seen corresponding path program 2 times [2025-04-14 00:56:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:41,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835096819] [2025-04-14 00:56:41,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:41,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:41,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:41,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:41,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:41,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835096819] [2025-04-14 00:56:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835096819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254153471] [2025-04-14 00:56:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:41,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:41,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:56:41,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:41,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:41,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:41,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:41,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:41,822 INFO L116 PetriNetUnfolderBase]: 1861/3072 cut-off events. [2025-04-14 00:56:41,822 INFO L117 PetriNetUnfolderBase]: For 2592/2592 co-relation queries the response was YES. [2025-04-14 00:56:41,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 3072 events. 1861/3072 cut-off events. For 2592/2592 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16895 event pairs, 470 based on Foata normal form. 36/3102 useless extension candidates. Maximal degree in co-relation 7415. Up to 1422 conditions per place. [2025-04-14 00:56:41,831 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 66 selfloop transitions, 24 changer transitions 29/122 dead transitions. [2025-04-14 00:56:41,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 765 flow [2025-04-14 00:56:41,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:56:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:56:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-04-14 00:56:41,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-04-14 00:56:41,835 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 268 flow. Second operand 6 states and 138 transitions. [2025-04-14 00:56:41,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 765 flow [2025-04-14 00:56:41,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 122 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:41,840 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 323 flow [2025-04-14 00:56:41,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-04-14 00:56:41,841 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2025-04-14 00:56:41,841 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 323 flow [2025-04-14 00:56:41,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:41,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:41,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:41,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:56:41,841 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:41,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash -344649102, now seen corresponding path program 3 times [2025-04-14 00:56:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:41,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206729066] [2025-04-14 00:56:41,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:41,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:41,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:41,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:41,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:41,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:41,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206729066] [2025-04-14 00:56:41,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206729066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:41,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128396213] [2025-04-14 00:56:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:41,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:41,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:41,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:56:41,961 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:41,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:41,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:41,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:41,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:42,174 INFO L116 PetriNetUnfolderBase]: 922/1555 cut-off events. [2025-04-14 00:56:42,174 INFO L117 PetriNetUnfolderBase]: For 1417/1417 co-relation queries the response was YES. [2025-04-14 00:56:42,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 1555 events. 922/1555 cut-off events. For 1417/1417 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7354 event pairs, 294 based on Foata normal form. 20/1574 useless extension candidates. Maximal degree in co-relation 1718. Up to 609 conditions per place. [2025-04-14 00:56:42,179 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 62 selfloop transitions, 21 changer transitions 12/98 dead transitions. [2025-04-14 00:56:42,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 638 flow [2025-04-14 00:56:42,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:56:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:56:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-04-14 00:56:42,180 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2025-04-14 00:56:42,180 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 323 flow. Second operand 6 states and 129 transitions. [2025-04-14 00:56:42,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 638 flow [2025-04-14 00:56:42,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 616 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:42,186 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 324 flow [2025-04-14 00:56:42,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-04-14 00:56:42,188 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-04-14 00:56:42,188 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 324 flow [2025-04-14 00:56:42,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:42,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:42,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:56:42,188 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:42,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 805379904, now seen corresponding path program 4 times [2025-04-14 00:56:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:42,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764733804] [2025-04-14 00:56:42,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:56:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:42,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:56:42,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:42,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:56:42,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:42,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764733804] [2025-04-14 00:56:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764733804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038088067] [2025-04-14 00:56:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:42,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:42,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:42,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:42,352 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:42,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:42,571 INFO L116 PetriNetUnfolderBase]: 819/1381 cut-off events. [2025-04-14 00:56:42,571 INFO L117 PetriNetUnfolderBase]: For 2079/2079 co-relation queries the response was YES. [2025-04-14 00:56:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1381 events. 819/1381 cut-off events. For 2079/2079 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6272 event pairs, 265 based on Foata normal form. 20/1400 useless extension candidates. Maximal degree in co-relation 1673. Up to 506 conditions per place. [2025-04-14 00:56:42,575 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 59 selfloop transitions, 20 changer transitions 17/99 dead transitions. [2025-04-14 00:56:42,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 672 flow [2025-04-14 00:56:42,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-04-14 00:56:42,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-04-14 00:56:42,577 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 324 flow. Second operand 8 states and 144 transitions. [2025-04-14 00:56:42,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 672 flow [2025-04-14 00:56:42,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 620 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-14 00:56:42,581 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 317 flow [2025-04-14 00:56:42,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-04-14 00:56:42,583 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2025-04-14 00:56:42,583 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 317 flow [2025-04-14 00:56:42,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:42,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:42,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:56:42,583 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:42,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2114442586, now seen corresponding path program 5 times [2025-04-14 00:56:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:42,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004059970] [2025-04-14 00:56:42,584 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:56:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:42,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:42,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:42,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:42,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:42,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004059970] [2025-04-14 00:56:42,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004059970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:42,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42956385] [2025-04-14 00:56:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:42,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:42,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:42,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:42,692 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:42,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 317 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:42,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:42,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:42,871 INFO L116 PetriNetUnfolderBase]: 651/1121 cut-off events. [2025-04-14 00:56:42,871 INFO L117 PetriNetUnfolderBase]: For 1910/1910 co-relation queries the response was YES. [2025-04-14 00:56:42,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 1121 events. 651/1121 cut-off events. For 1910/1910 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4881 event pairs, 220 based on Foata normal form. 16/1136 useless extension candidates. Maximal degree in co-relation 1755. Up to 384 conditions per place. [2025-04-14 00:56:42,874 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 50 selfloop transitions, 14 changer transitions 27/94 dead transitions. [2025-04-14 00:56:42,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 637 flow [2025-04-14 00:56:42,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2025-04-14 00:56:42,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2025-04-14 00:56:42,877 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 317 flow. Second operand 8 states and 138 transitions. [2025-04-14 00:56:42,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 637 flow [2025-04-14 00:56:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 585 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-14 00:56:42,879 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 233 flow [2025-04-14 00:56:42,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-04-14 00:56:42,883 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-04-14 00:56:42,883 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 233 flow [2025-04-14 00:56:42,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:42,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:42,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:56:42,883 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:42,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash -434759647, now seen corresponding path program 3 times [2025-04-14 00:56:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:42,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118019807] [2025-04-14 00:56:42,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:42,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:56:42,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:56:42,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:42,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:42,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118019807] [2025-04-14 00:56:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118019807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760714707] [2025-04-14 00:56:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:42,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:42,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:42,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:42,973 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-14 00:56:42,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:42,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:42,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-14 00:56:42,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:43,087 INFO L116 PetriNetUnfolderBase]: 93/201 cut-off events. [2025-04-14 00:56:43,088 INFO L117 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-04-14 00:56:43,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 201 events. 93/201 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 594 event pairs, 25 based on Foata normal form. 8/208 useless extension candidates. Maximal degree in co-relation 509. Up to 55 conditions per place. [2025-04-14 00:56:43,088 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 0 selfloop transitions, 0 changer transitions 52/52 dead transitions. [2025-04-14 00:56:43,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 337 flow [2025-04-14 00:56:43,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-04-14 00:56:43,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28125 [2025-04-14 00:56:43,089 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 233 flow. Second operand 8 states and 99 transitions. [2025-04-14 00:56:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 337 flow [2025-04-14 00:56:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 268 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-04-14 00:56:43,090 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2025-04-14 00:56:43,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2025-04-14 00:56:43,091 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-04-14 00:56:43,091 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2025-04-14 00:56:43,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:43,094 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:56:43,095 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:56:43,096 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:56:43,096 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:56:43,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:56:43,096 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1] [2025-04-14 00:56:43,099 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:56:43,099 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:56:43,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:56:43 BasicIcfg [2025-04-14 00:56:43,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:56:43,104 INFO L158 Benchmark]: Toolchain (without parser) took 4737.87ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 106.0MB in the beginning and 77.8MB in the end (delta: 28.2MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. [2025-04-14 00:56:43,104 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:56:43,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.66ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 91.9MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:56:43,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.55ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 89.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:56:43,106 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:56:43,106 INFO L158 Benchmark]: IcfgBuilder took 378.79ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 51.9MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:56:43,106 INFO L158 Benchmark]: TraceAbstraction took 4068.12ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 51.9MB in the beginning and 77.8MB in the end (delta: -25.9MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. [2025-04-14 00:56:43,107 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.18ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.66ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 91.9MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.55ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 89.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 378.79ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 51.9MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4068.12ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 51.9MB in the beginning and 77.8MB in the end (delta: -25.9MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 71 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1521 IncrementalHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 0 mSDtfsCounter, 1521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=6, InterpolantAutomatonStates: 52, 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.0s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:56:43,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...