/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/chl-poker-hand-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:39:30,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:39:30,734 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:39:30,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:39:30,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:39:30,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:39:30,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:39:30,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:39:30,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:39:30,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:39:30,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:39:30,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:39:30,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:39:30,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:30,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:30,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:39:30,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:39:30,757 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:39:30,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:39:30,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:39:30,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:39:30,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:39:30,974 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:39:30,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-14 00:39:32,251 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3f38b7/b51a70a1680942ca9a9219562d2cbbe7/FLAG223359e04 [2025-04-14 00:39:32,478 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:39:32,479 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-14 00:39:32,487 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3f38b7/b51a70a1680942ca9a9219562d2cbbe7/FLAG223359e04 [2025-04-14 00:39:33,301 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3f38b7/b51a70a1680942ca9a9219562d2cbbe7 [2025-04-14 00:39:33,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:39:33,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:39:33,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:39:33,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:39:33,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:39:33,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44618221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33, skipping insertion in model container [2025-04-14 00:39:33,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:39:33,591 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/chl-poker-hand-subst.wvr.c[19288,19301] [2025-04-14 00:39:33,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:39:33,603 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:39:33,688 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/chl-poker-hand-subst.wvr.c[19288,19301] [2025-04-14 00:39:33,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:39:33,703 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:39:33,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33 WrapperNode [2025-04-14 00:39:33,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:39:33,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:39:33,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:39:33,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:39:33,710 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:39:33" (1/1) ... [2025-04-14 00:39:33,729 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:39:33" (1/1) ... [2025-04-14 00:39:33,793 INFO L138 Inliner]: procedures = 25, calls = 439, calls flagged for inlining = 100, calls inlined = 144, statements flattened = 2348 [2025-04-14 00:39:33,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:39:33,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:39:33,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:39:33,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:39:33,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,865 INFO L175 MemorySlicer]: Split 278 memory accesses to 2 slices as follows [2, 276]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-04-14 00:39:33,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:39:33,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:39:33,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:39:33,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:39:33,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (1/1) ... [2025-04-14 00:39:33,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:39:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:33,969 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:39:33,972 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:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:39:33,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:39:33,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:39:33,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:39:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:39:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:39:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:39:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:39:33,990 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:39:34,152 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:39:34,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:39:35,813 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:39:35,813 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:39:35,814 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:39:38,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:39:38,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:39:38 BoogieIcfgContainer [2025-04-14 00:39:38,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:39:38,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:39:38,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:39:38,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:39:38,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:39:33" (1/3) ... [2025-04-14 00:39:38,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797d88c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:39:38, skipping insertion in model container [2025-04-14 00:39:38,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:39:33" (2/3) ... [2025-04-14 00:39:38,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797d88c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:39:38, skipping insertion in model container [2025-04-14 00:39:38,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:39:38" (3/3) ... [2025-04-14 00:39:38,046 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-subst.wvr.c [2025-04-14 00:39:38,060 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:39:38,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-poker-hand-subst.wvr.c that has 4 procedures, 73 locations, 105 edges, 1 initial locations, 18 loop locations, and 1 error locations. [2025-04-14 00:39:38,061 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:39:38,353 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:39:38,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 237 flow [2025-04-14 00:39:38,520 INFO L116 PetriNetUnfolderBase]: 36/105 cut-off events. [2025-04-14 00:39:38,524 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:39:38,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 36/105 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 284 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2025-04-14 00:39:38,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 108 transitions, 237 flow [2025-04-14 00:39:38,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 104 transitions, 226 flow [2025-04-14 00:39:38,541 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:39:38,551 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;@4cfce8f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:39:38,551 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:39:38,598 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:39:38,598 INFO L116 PetriNetUnfolderBase]: 36/103 cut-off events. [2025-04-14 00:39:38,598 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:39:38,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:38,599 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] [2025-04-14 00:39:38,599 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:39:38,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1229934448, now seen corresponding path program 1 times [2025-04-14 00:39:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:38,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182531096] [2025-04-14 00:39:38,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:39:38,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:39:38,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:38,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:39,140 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:39:39,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:39,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182531096] [2025-04-14 00:39:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182531096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:39,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139942836] [2025-04-14 00:39:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:39,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:39,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:39,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:39,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:39:39,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 104 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:39:39,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:39,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:39:39,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:46,351 INFO L116 PetriNetUnfolderBase]: 33522/42548 cut-off events. [2025-04-14 00:39:46,351 INFO L117 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2025-04-14 00:39:46,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85920 conditions, 42548 events. 33522/42548 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 206355 event pairs, 20430 based on Foata normal form. 0/29456 useless extension candidates. Maximal degree in co-relation 83516. Up to 42546 conditions per place. [2025-04-14 00:39:46,500 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 101 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-04-14 00:39:46,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 107 transitions, 446 flow [2025-04-14 00:39:46,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-04-14 00:39:46,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36728395061728397 [2025-04-14 00:39:46,514 INFO L175 Difference]: Start difference. First operand has 78 places, 104 transitions, 226 flow. Second operand 3 states and 119 transitions. [2025-04-14 00:39:46,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 107 transitions, 446 flow [2025-04-14 00:39:46,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 107 transitions, 434 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:39:46,539 INFO L231 Difference]: Finished difference. Result has 75 places, 107 transitions, 246 flow [2025-04-14 00:39:46,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=75, PETRI_TRANSITIONS=107} [2025-04-14 00:39:46,543 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-04-14 00:39:46,543 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 107 transitions, 246 flow [2025-04-14 00:39:46,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:39:46,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:46,544 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] [2025-04-14 00:39:46,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:39:46,544 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:39:46,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash 768017472, now seen corresponding path program 1 times [2025-04-14 00:39:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:46,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799964056] [2025-04-14 00:39:46,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:46,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:39:46,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:39:46,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:46,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:39:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:46,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799964056] [2025-04-14 00:39:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799964056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:46,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:39:46,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:39:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630341840] [2025-04-14 00:39:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:46,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:46,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:46,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:39:46,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:39:46,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 107 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:39:46,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:46,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:39:46,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:53,324 INFO L116 PetriNetUnfolderBase]: 33522/42554 cut-off events. [2025-04-14 00:39:53,324 INFO L117 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-04-14 00:39:53,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85398 conditions, 42554 events. 33522/42554 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 205448 event pairs, 20430 based on Foata normal form. 0/29465 useless extension candidates. Maximal degree in co-relation 85355. Up to 42549 conditions per place. [2025-04-14 00:39:53,436 INFO L140 encePairwiseOnDemand]: 95/108 looper letters, 101 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2025-04-14 00:39:53,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 484 flow [2025-04-14 00:39:53,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:39:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:39:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-04-14 00:39:53,437 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38580246913580246 [2025-04-14 00:39:53,437 INFO L175 Difference]: Start difference. First operand has 75 places, 107 transitions, 246 flow. Second operand 3 states and 125 transitions. [2025-04-14 00:39:53,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 484 flow [2025-04-14 00:39:53,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:39:53,439 INFO L231 Difference]: Finished difference. Result has 77 places, 113 transitions, 302 flow [2025-04-14 00:39:53,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=77, PETRI_TRANSITIONS=113} [2025-04-14 00:39:53,440 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-04-14 00:39:53,440 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 302 flow [2025-04-14 00:39:53,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:39:53,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:53,440 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, 1, 1, 1, 1] [2025-04-14 00:39:53,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:39:53,440 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:39:53,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1295588310, now seen corresponding path program 1 times [2025-04-14 00:39:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:53,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460397123] [2025-04-14 00:39:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:53,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 00:39:53,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 00:39:53,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:53,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 00:39:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:53,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460397123] [2025-04-14 00:39:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460397123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:53,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056764736] [2025-04-14 00:39:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:39:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:53,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:53,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:39:54,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 00:39:54,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 00:39:54,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:54,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:54,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 00:39:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 00:39:54,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:39:54,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056764736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:54,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:39:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-04-14 00:39:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750940809] [2025-04-14 00:39:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:54,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:39:54,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:54,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:39:54,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:39:54,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:39:54,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:39:54,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:54,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:39:54,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:00,448 INFO L116 PetriNetUnfolderBase]: 33522/42557 cut-off events. [2025-04-14 00:40:00,448 INFO L117 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-04-14 00:40:00,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85427 conditions, 42557 events. 33522/42557 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 205400 event pairs, 20430 based on Foata normal form. 1/29473 useless extension candidates. Maximal degree in co-relation 85373. Up to 42552 conditions per place. [2025-04-14 00:40:00,558 INFO L140 encePairwiseOnDemand]: 96/108 looper letters, 104 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2025-04-14 00:40:00,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 540 flow [2025-04-14 00:40:00,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:40:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:40:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-04-14 00:40:00,559 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2025-04-14 00:40:00,559 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 302 flow. Second operand 3 states and 122 transitions. [2025-04-14 00:40:00,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 540 flow [2025-04-14 00:40:00,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:40:00,562 INFO L231 Difference]: Finished difference. Result has 79 places, 116 transitions, 338 flow [2025-04-14 00:40:00,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=79, PETRI_TRANSITIONS=116} [2025-04-14 00:40:00,562 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-04-14 00:40:00,562 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 116 transitions, 338 flow [2025-04-14 00:40:00,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:40:00,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:00,563 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:40:00,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:40:00,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:00,765 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:40:00,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1561642425, now seen corresponding path program 1 times [2025-04-14 00:40:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:00,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550484979] [2025-04-14 00:40:00,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:00,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:40:00,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:40:00,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:00,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 00:40:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:01,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550484979] [2025-04-14 00:40:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550484979] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:40:01,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217110066] [2025-04-14 00:40:01,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:01,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:40:01,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:40:01,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:40:01,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:40:01,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:40:01,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:01,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:01,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:40:01,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:40:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 00:40:01,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:40:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 00:40:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217110066] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:40:01,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:40:01,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-14 00:40:01,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208070848] [2025-04-14 00:40:01,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:40:01,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:40:01,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:01,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:40:01,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:40:01,587 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:01,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 116 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:40:01,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:01,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:01,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:08,144 INFO L116 PetriNetUnfolderBase]: 33522/42581 cut-off events. [2025-04-14 00:40:08,144 INFO L117 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-04-14 00:40:08,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85515 conditions, 42581 events. 33522/42581 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 1851. Compared 205456 event pairs, 20430 based on Foata normal form. 18/29513 useless extension candidates. Maximal degree in co-relation 85401. Up to 42546 conditions per place. [2025-04-14 00:40:08,249 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 92 selfloop transitions, 48 changer transitions 0/140 dead transitions. [2025-04-14 00:40:08,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 140 transitions, 714 flow [2025-04-14 00:40:08,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:40:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:40:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-04-14 00:40:08,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2175925925925926 [2025-04-14 00:40:08,252 INFO L175 Difference]: Start difference. First operand has 79 places, 116 transitions, 338 flow. Second operand 8 states and 188 transitions. [2025-04-14 00:40:08,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 140 transitions, 714 flow [2025-04-14 00:40:08,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 140 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:40:08,254 INFO L231 Difference]: Finished difference. Result has 86 places, 140 transitions, 568 flow [2025-04-14 00:40:08,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=86, PETRI_TRANSITIONS=140} [2025-04-14 00:40:08,255 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-04-14 00:40:08,255 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 140 transitions, 568 flow [2025-04-14 00:40:08,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:40:08,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:08,255 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 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:40:08,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:40:08,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 00:40:08,456 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:40:08,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash 638676172, now seen corresponding path program 1 times [2025-04-14 00:40:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:08,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509032756] [2025-04-14 00:40:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:40:08,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:40:08,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:08,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-14 00:40:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:08,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509032756] [2025-04-14 00:40:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509032756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:40:08,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237554330] [2025-04-14 00:40:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:40:08,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:40:08,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:40:09,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:40:09,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:40:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:40:09,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:40:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-14 00:40:09,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:40:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-14 00:40:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237554330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:40:09,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:40:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-14 00:40:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534201658] [2025-04-14 00:40:09,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:40:09,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:40:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:09,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:40:09,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=156, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:40:09,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:09,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 140 transitions, 568 flow. Second operand has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 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:40:09,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:09,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:09,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:16,220 INFO L116 PetriNetUnfolderBase]: 33522/42614 cut-off events. [2025-04-14 00:40:16,220 INFO L117 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-04-14 00:40:16,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85715 conditions, 42614 events. 33522/42614 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 205953 event pairs, 20430 based on Foata normal form. 29/29560 useless extension candidates. Maximal degree in co-relation 85509. Up to 42546 conditions per place. [2025-04-14 00:40:16,348 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 92 selfloop transitions, 81 changer transitions 0/173 dead transitions. [2025-04-14 00:40:16,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 173 transitions, 1112 flow [2025-04-14 00:40:16,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:40:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:40:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 257 transitions. [2025-04-14 00:40:16,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.13997821350762527 [2025-04-14 00:40:16,350 INFO L175 Difference]: Start difference. First operand has 86 places, 140 transitions, 568 flow. Second operand 17 states and 257 transitions. [2025-04-14 00:40:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 173 transitions, 1112 flow [2025-04-14 00:40:16,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 173 transitions, 972 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-14 00:40:16,354 INFO L231 Difference]: Finished difference. Result has 101 places, 173 transitions, 858 flow [2025-04-14 00:40:16,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=858, PETRI_PLACES=101, PETRI_TRANSITIONS=173} [2025-04-14 00:40:16,354 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-04-14 00:40:16,355 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 173 transitions, 858 flow [2025-04-14 00:40:16,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 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:40:16,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:16,358 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:40:16,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:40:16,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:16,559 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:40:16,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 957182711, now seen corresponding path program 1 times [2025-04-14 00:40:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:16,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711087234] [2025-04-14 00:40:16,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-14 00:40:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-14 00:40:16,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-04-14 00:40:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:16,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711087234] [2025-04-14 00:40:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711087234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:40:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:40:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:40:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244644273] [2025-04-14 00:40:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:40:16,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:40:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:16,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:40:16,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:40:16,935 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:16,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 173 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:40:16,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:16,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:16,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:24,854 INFO L116 PetriNetUnfolderBase]: 37351/47808 cut-off events. [2025-04-14 00:40:24,854 INFO L117 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-04-14 00:40:24,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96185 conditions, 47808 events. 37351/47808 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 2103. Compared 241566 event pairs, 20430 based on Foata normal form. 1/33407 useless extension candidates. Maximal degree in co-relation 96086. Up to 42069 conditions per place. [2025-04-14 00:40:25,035 INFO L140 encePairwiseOnDemand]: 106/108 looper letters, 171 selfloop transitions, 0 changer transitions 57/228 dead transitions. [2025-04-14 00:40:25,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 228 transitions, 1429 flow [2025-04-14 00:40:25,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:40:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:40:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-04-14 00:40:25,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2025-04-14 00:40:25,037 INFO L175 Difference]: Start difference. First operand has 101 places, 173 transitions, 858 flow. Second operand 3 states and 169 transitions. [2025-04-14 00:40:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 228 transitions, 1429 flow [2025-04-14 00:40:25,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 228 transitions, 1303 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-04-14 00:40:25,042 INFO L231 Difference]: Finished difference. Result has 99 places, 171 transitions, 730 flow [2025-04-14 00:40:25,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=99, PETRI_TRANSITIONS=171} [2025-04-14 00:40:25,043 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-04-14 00:40:25,043 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 171 transitions, 730 flow [2025-04-14 00:40:25,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:40:25,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:25,043 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:40:25,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:40:25,044 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:40:25,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 80012149, now seen corresponding path program 1 times [2025-04-14 00:40:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:25,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294234443] [2025-04-14 00:40:25,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:25,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-14 00:40:25,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-14 00:40:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-14 00:40:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:25,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294234443] [2025-04-14 00:40:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294234443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:40:25,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372572279] [2025-04-14 00:40:25,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:25,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:40:25,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:40:25,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:40:26,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-14 00:40:26,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-14 00:40:26,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:26,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:26,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 00:40:26,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:40:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-14 00:40:26,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:40:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-14 00:40:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372572279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:40:26,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:40:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-04-14 00:40:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64396629] [2025-04-14 00:40:26,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:40:26,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 00:40:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:26,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 00:40:26,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=722, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 00:40:26,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:26,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 171 transitions, 730 flow. Second operand has 35 states, 35 states have (on average 5.257142857142857) internal successors, (184), 35 states have internal predecessors, (184), 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:40:26,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:26,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:26,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:33,563 INFO L116 PetriNetUnfolderBase]: 31168/39723 cut-off events. [2025-04-14 00:40:33,563 INFO L117 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-04-14 00:40:33,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79922 conditions, 39723 events. 31168/39723 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 192050 event pairs, 19150 based on Foata normal form. 3/27718 useless extension candidates. Maximal degree in co-relation 79911. Up to 39646 conditions per place. [2025-04-14 00:40:33,725 INFO L140 encePairwiseOnDemand]: 84/108 looper letters, 90 selfloop transitions, 90 changer transitions 0/180 dead transitions. [2025-04-14 00:40:33,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 180 transitions, 1144 flow [2025-04-14 00:40:33,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:40:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:40:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 243 transitions. [2025-04-14 00:40:33,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.125 [2025-04-14 00:40:33,727 INFO L175 Difference]: Start difference. First operand has 99 places, 171 transitions, 730 flow. Second operand 18 states and 243 transitions. [2025-04-14 00:40:33,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 180 transitions, 1144 flow [2025-04-14 00:40:33,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 180 transitions, 1142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:40:33,730 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 968 flow [2025-04-14 00:40:33,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=968, PETRI_PLACES=113, PETRI_TRANSITIONS=180} [2025-04-14 00:40:33,732 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-04-14 00:40:33,732 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 968 flow [2025-04-14 00:40:33,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.257142857142857) internal successors, (184), 35 states have internal predecessors, (184), 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:40:33,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:33,733 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:40:33,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:40:33,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:33,933 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:40:33,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 948506395, now seen corresponding path program 1 times [2025-04-14 00:40:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:33,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131004440] [2025-04-14 00:40:33,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:33,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:40:34,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:40:34,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:34,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:40:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:34,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131004440] [2025-04-14 00:40:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131004440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:40:34,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:40:34,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:40:34,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595325938] [2025-04-14 00:40:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:40:34,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:40:34,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:34,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:40:34,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:40:34,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:34,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 968 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:40:34,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:34,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:34,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:45,366 INFO L116 PetriNetUnfolderBase]: 48389/62391 cut-off events. [2025-04-14 00:40:45,366 INFO L117 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-04-14 00:40:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125504 conditions, 62391 events. 48389/62391 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 2529. Compared 336816 event pairs, 17020 based on Foata normal form. 1/44542 useless extension candidates. Maximal degree in co-relation 125493. Up to 36184 conditions per place. [2025-04-14 00:40:45,630 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 270 selfloop transitions, 17 changer transitions 32/319 dead transitions. [2025-04-14 00:40:45,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 319 transitions, 1894 flow [2025-04-14 00:40:45,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:40:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:40:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-04-14 00:40:45,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5879629629629629 [2025-04-14 00:40:45,633 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 968 flow. Second operand 4 states and 254 transitions. [2025-04-14 00:40:45,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 319 transitions, 1894 flow [2025-04-14 00:40:45,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 319 transitions, 1786 flow, removed 15 selfloop flow, removed 9 redundant places. [2025-04-14 00:40:45,637 INFO L231 Difference]: Finished difference. Result has 110 places, 191 transitions, 978 flow [2025-04-14 00:40:45,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=978, PETRI_PLACES=110, PETRI_TRANSITIONS=191} [2025-04-14 00:40:45,638 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-04-14 00:40:45,638 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 191 transitions, 978 flow [2025-04-14 00:40:45,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:40:45,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:45,638 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:40:45,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:40:45,638 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:40:45,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1886149773, now seen corresponding path program 1 times [2025-04-14 00:40:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:45,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505548713] [2025-04-14 00:40:45,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:40:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:45,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:40:45,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:40:45,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:40:45,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:40:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:46,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505548713] [2025-04-14 00:40:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505548713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:40:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:40:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:40:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664390426] [2025-04-14 00:40:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:40:46,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:40:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:40:46,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:40:46,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:46,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 191 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:40:46,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:46,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:46,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:57,210 INFO L116 PetriNetUnfolderBase]: 44345/58032 cut-off events. [2025-04-14 00:40:57,211 INFO L117 PetriNetUnfolderBase]: For 17782/17782 co-relation queries the response was YES. [2025-04-14 00:40:57,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131204 conditions, 58032 events. 44345/58032 cut-off events. For 17782/17782 co-relation queries the response was YES. Maximal size of possible extension queue 2482. Compared 321285 event pairs, 23564 based on Foata normal form. 320/42812 useless extension candidates. Maximal degree in co-relation 131190. Up to 45938 conditions per place. [2025-04-14 00:40:57,532 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 251 selfloop transitions, 6 changer transitions 4/261 dead transitions. [2025-04-14 00:40:57,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 261 transitions, 1685 flow [2025-04-14 00:40:57,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:40:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:40:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-04-14 00:40:57,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2025-04-14 00:40:57,534 INFO L175 Difference]: Start difference. First operand has 110 places, 191 transitions, 978 flow. Second operand 3 states and 175 transitions. [2025-04-14 00:40:57,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 261 transitions, 1685 flow [2025-04-14 00:40:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 261 transitions, 1669 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:40:57,588 INFO L231 Difference]: Finished difference. Result has 110 places, 194 transitions, 1016 flow [2025-04-14 00:40:57,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=110, PETRI_TRANSITIONS=194} [2025-04-14 00:40:57,589 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-04-14 00:40:57,589 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 194 transitions, 1016 flow [2025-04-14 00:40:57,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:40:57,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:57,589 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:40:57,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:40:57,589 INFO L403 AbstractCegarLoop]: === Iteration 10 === 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:40:57,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -177714079, now seen corresponding path program 2 times [2025-04-14 00:40:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:57,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626877492] [2025-04-14 00:40:57,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:40:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:57,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:40:57,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:40:57,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:40:57,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:40:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:58,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626877492] [2025-04-14 00:40:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626877492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:40:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:40:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:40:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240220639] [2025-04-14 00:40:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:40:58,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:40:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:58,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:40:58,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:40:58,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:40:58,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 194 transitions, 1016 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:40:58,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:58,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:40:58,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:41:10,256 INFO L116 PetriNetUnfolderBase]: 50408/66761 cut-off events. [2025-04-14 00:41:10,256 INFO L117 PetriNetUnfolderBase]: For 32444/32444 co-relation queries the response was YES. [2025-04-14 00:41:10,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155167 conditions, 66761 events. 50408/66761 cut-off events. For 32444/32444 co-relation queries the response was YES. Maximal size of possible extension queue 2931. Compared 388918 event pairs, 20357 based on Foata normal form. 772/49792 useless extension candidates. Maximal degree in co-relation 155152. Up to 35061 conditions per place. [2025-04-14 00:41:10,636 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 259 selfloop transitions, 5 changer transitions 3/267 dead transitions. [2025-04-14 00:41:10,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 267 transitions, 1793 flow [2025-04-14 00:41:10,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:41:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:41:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-04-14 00:41:10,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-14 00:41:10,638 INFO L175 Difference]: Start difference. First operand has 110 places, 194 transitions, 1016 flow. Second operand 3 states and 167 transitions. [2025-04-14 00:41:10,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 267 transitions, 1793 flow [2025-04-14 00:41:10,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 267 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:41:10,774 INFO L231 Difference]: Finished difference. Result has 113 places, 199 transitions, 1067 flow [2025-04-14 00:41:10,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=113, PETRI_TRANSITIONS=199} [2025-04-14 00:41:10,775 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-04-14 00:41:10,775 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 199 transitions, 1067 flow [2025-04-14 00:41:10,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:41:10,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:41:10,775 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:41:10,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:41:10,775 INFO L403 AbstractCegarLoop]: === Iteration 11 === 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:41:10,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:41:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 778442593, now seen corresponding path program 3 times [2025-04-14 00:41:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:41:10,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903396379] [2025-04-14 00:41:10,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:41:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:41:10,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:41:10,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:41:10,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:41:10,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:41:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:41:11,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903396379] [2025-04-14 00:41:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903396379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:41:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:41:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:41:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347775300] [2025-04-14 00:41:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:41:11,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:41:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:41:11,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:41:11,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:41:11,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:41:11,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 199 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:41:11,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:41:11,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:41:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:41:23,420 INFO L116 PetriNetUnfolderBase]: 51751/68866 cut-off events. [2025-04-14 00:41:23,420 INFO L117 PetriNetUnfolderBase]: For 36874/36874 co-relation queries the response was YES. [2025-04-14 00:41:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166927 conditions, 68866 events. 51751/68866 cut-off events. For 36874/36874 co-relation queries the response was YES. Maximal size of possible extension queue 2995. Compared 410733 event pairs, 23753 based on Foata normal form. 512/51099 useless extension candidates. Maximal degree in co-relation 166911. Up to 37873 conditions per place. [2025-04-14 00:41:23,844 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 250 selfloop transitions, 10 changer transitions 3/263 dead transitions. [2025-04-14 00:41:23,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 263 transitions, 1794 flow [2025-04-14 00:41:23,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:41:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:41:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-04-14 00:41:23,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-14 00:41:23,845 INFO L175 Difference]: Start difference. First operand has 113 places, 199 transitions, 1067 flow. Second operand 3 states and 167 transitions. [2025-04-14 00:41:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 263 transitions, 1794 flow [2025-04-14 00:41:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 263 transitions, 1785 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:41:24,106 INFO L231 Difference]: Finished difference. Result has 116 places, 204 transitions, 1153 flow [2025-04-14 00:41:24,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=116, PETRI_TRANSITIONS=204} [2025-04-14 00:41:24,107 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 38 predicate places. [2025-04-14 00:41:24,107 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 204 transitions, 1153 flow [2025-04-14 00:41:24,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:41:24,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:41:24,107 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:41:24,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:41:24,108 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:41:24,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:41:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -163692739, now seen corresponding path program 1 times [2025-04-14 00:41:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:41:24,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400512160] [2025-04-14 00:41:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:41:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:41:24,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:41:24,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:41:24,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:41:24,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:41:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:41:25,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400512160] [2025-04-14 00:41:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400512160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:41:25,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:41:25,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:41:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646020810] [2025-04-14 00:41:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:41:25,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:41:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:41:25,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:41:25,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:41:25,122 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:41:25,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 204 transitions, 1153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:41:25,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:41:25,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:41:25,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:41:38,435 INFO L116 PetriNetUnfolderBase]: 53520/71539 cut-off events. [2025-04-14 00:41:38,436 INFO L117 PetriNetUnfolderBase]: For 55686/55686 co-relation queries the response was YES. [2025-04-14 00:41:38,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179506 conditions, 71539 events. 53520/71539 cut-off events. For 55686/55686 co-relation queries the response was YES. Maximal size of possible extension queue 3185. Compared 427785 event pairs, 33815 based on Foata normal form. 356/53034 useless extension candidates. Maximal degree in co-relation 179489. Up to 61827 conditions per place. [2025-04-14 00:41:38,984 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 266 selfloop transitions, 5 changer transitions 4/275 dead transitions. [2025-04-14 00:41:38,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 275 transitions, 1979 flow [2025-04-14 00:41:38,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:41:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:41:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-04-14 00:41:38,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-14 00:41:38,986 INFO L175 Difference]: Start difference. First operand has 116 places, 204 transitions, 1153 flow. Second operand 3 states and 167 transitions. [2025-04-14 00:41:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 275 transitions, 1979 flow [2025-04-14 00:41:39,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 275 transitions, 1953 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:41:39,218 INFO L231 Difference]: Finished difference. Result has 119 places, 209 transitions, 1213 flow [2025-04-14 00:41:39,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=119, PETRI_TRANSITIONS=209} [2025-04-14 00:41:39,220 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 41 predicate places. [2025-04-14 00:41:39,220 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 209 transitions, 1213 flow [2025-04-14 00:41:39,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:41:39,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:41:39,220 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:41:39,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:41:39,220 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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:41:39,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:41:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 872702769, now seen corresponding path program 1 times [2025-04-14 00:41:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:41:39,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492931792] [2025-04-14 00:41:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:41:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:41:39,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:41:39,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:41:39,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:41:39,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:41:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:41:40,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492931792] [2025-04-14 00:41:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492931792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:41:40,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:41:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:41:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380987955] [2025-04-14 00:41:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:41:40,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:41:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:41:40,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:41:40,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:41:40,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:41:40,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 209 transitions, 1213 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:41:40,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:41:40,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:41:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:41:54,711 INFO L116 PetriNetUnfolderBase]: 57074/76675 cut-off events. [2025-04-14 00:41:54,712 INFO L117 PetriNetUnfolderBase]: For 61494/61494 co-relation queries the response was YES. [2025-04-14 00:41:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197197 conditions, 76675 events. 57074/76675 cut-off events. For 61494/61494 co-relation queries the response was YES. Maximal size of possible extension queue 3512. Compared 470860 event pairs, 38546 based on Foata normal form. 1/56774 useless extension candidates. Maximal degree in co-relation 197179. Up to 70947 conditions per place. [2025-04-14 00:41:55,247 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 250 selfloop transitions, 3 changer transitions 24/277 dead transitions. [2025-04-14 00:41:55,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 277 transitions, 2015 flow [2025-04-14 00:41:55,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:41:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:41:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-04-14 00:41:55,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2025-04-14 00:41:55,249 INFO L175 Difference]: Start difference. First operand has 119 places, 209 transitions, 1213 flow. Second operand 4 states and 166 transitions. [2025-04-14 00:41:55,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 277 transitions, 2015 flow [2025-04-14 00:41:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 277 transitions, 1989 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 00:41:55,728 INFO L231 Difference]: Finished difference. Result has 123 places, 209 transitions, 1213 flow [2025-04-14 00:41:55,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1213, PETRI_PLACES=123, PETRI_TRANSITIONS=209} [2025-04-14 00:41:55,730 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2025-04-14 00:41:55,730 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 209 transitions, 1213 flow [2025-04-14 00:41:55,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:41:55,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:41:55,730 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:41:55,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:41:55,730 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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:41:55,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:41:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1056951083, now seen corresponding path program 2 times [2025-04-14 00:41:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:41:55,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341450453] [2025-04-14 00:41:55,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:41:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:41:55,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:41:55,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:41:55,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:41:55,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:41:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:41:56,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:41:56,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341450453] [2025-04-14 00:41:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341450453] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:41:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:41:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:41:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328670329] [2025-04-14 00:41:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:41:56,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:41:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:41:56,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:41:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:41:56,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:41:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 209 transitions, 1213 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:41:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:41:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:41:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:11,939 INFO L116 PetriNetUnfolderBase]: 59970/80917 cut-off events. [2025-04-14 00:42:11,939 INFO L117 PetriNetUnfolderBase]: For 64866/64866 co-relation queries the response was YES. [2025-04-14 00:42:12,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208711 conditions, 80917 events. 59970/80917 cut-off events. For 64866/64866 co-relation queries the response was YES. Maximal size of possible extension queue 3798. Compared 504197 event pairs, 41571 based on Foata normal form. 1/60150 useless extension candidates. Maximal degree in co-relation 208691. Up to 75587 conditions per place. [2025-04-14 00:42:12,517 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 256 selfloop transitions, 2 changer transitions 25/283 dead transitions. [2025-04-14 00:42:12,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 283 transitions, 2099 flow [2025-04-14 00:42:12,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:42:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:42:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-04-14 00:42:12,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2025-04-14 00:42:12,519 INFO L175 Difference]: Start difference. First operand has 123 places, 209 transitions, 1213 flow. Second operand 4 states and 164 transitions. [2025-04-14 00:42:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 283 transitions, 2099 flow [2025-04-14 00:42:12,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 283 transitions, 2089 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:42:12,727 INFO L231 Difference]: Finished difference. Result has 125 places, 209 transitions, 1222 flow [2025-04-14 00:42:12,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1222, PETRI_PLACES=125, PETRI_TRANSITIONS=209} [2025-04-14 00:42:12,728 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2025-04-14 00:42:12,728 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 209 transitions, 1222 flow [2025-04-14 00:42:12,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:42:12,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:12,728 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:42:12,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:42:12,728 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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:42:12,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:12,729 INFO L85 PathProgramCache]: Analyzing trace with hash 573623933, now seen corresponding path program 1 times [2025-04-14 00:42:12,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:12,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134169739] [2025-04-14 00:42:12,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:42:12,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:12,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:42:12,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:42:12,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:42:12,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:42:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:13,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134169739] [2025-04-14 00:42:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134169739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:42:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513084443] [2025-04-14 00:42:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:13,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:42:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:13,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:42:13,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:42:13,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:42:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 209 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:42:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:29,323 INFO L116 PetriNetUnfolderBase]: 65076/88614 cut-off events. [2025-04-14 00:42:29,324 INFO L117 PetriNetUnfolderBase]: For 75921/75921 co-relation queries the response was YES. [2025-04-14 00:42:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226770 conditions, 88614 events. 65076/88614 cut-off events. For 75921/75921 co-relation queries the response was YES. Maximal size of possible extension queue 4262. Compared 578027 event pairs, 29618 based on Foata normal form. 920/66892 useless extension candidates. Maximal degree in co-relation 226749. Up to 48791 conditions per place. [2025-04-14 00:42:29,950 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 269 selfloop transitions, 15 changer transitions 4/288 dead transitions. [2025-04-14 00:42:29,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 288 transitions, 2154 flow [2025-04-14 00:42:29,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:42:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:42:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-14 00:42:29,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-04-14 00:42:29,952 INFO L175 Difference]: Start difference. First operand has 125 places, 209 transitions, 1222 flow. Second operand 3 states and 165 transitions. [2025-04-14 00:42:29,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 288 transitions, 2154 flow [2025-04-14 00:42:30,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 288 transitions, 2147 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:42:30,376 INFO L231 Difference]: Finished difference. Result has 126 places, 222 transitions, 1428 flow [2025-04-14 00:42:30,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=126, PETRI_TRANSITIONS=222} [2025-04-14 00:42:30,377 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-04-14 00:42:30,377 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 222 transitions, 1428 flow [2025-04-14 00:42:30,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:30,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:30,377 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:42:30,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:42:30,377 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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:42:30,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1121595211, now seen corresponding path program 2 times [2025-04-14 00:42:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:30,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592069689] [2025-04-14 00:42:30,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:42:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:30,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:42:30,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:42:30,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:42:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:42:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:30,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592069689] [2025-04-14 00:42:30,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592069689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:30,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:30,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:42:30,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340027298] [2025-04-14 00:42:30,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:30,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:42:30,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:30,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:42:30,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:42:30,793 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:42:30,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 222 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:30,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:30,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:42:30,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:42:46,852 INFO L116 PetriNetUnfolderBase]: 64758/88511 cut-off events. [2025-04-14 00:42:46,853 INFO L117 PetriNetUnfolderBase]: For 107773/107773 co-relation queries the response was YES. [2025-04-14 00:42:47,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233580 conditions, 88511 events. 64758/88511 cut-off events. For 107773/107773 co-relation queries the response was YES. Maximal size of possible extension queue 4260. Compared 579204 event pairs, 40771 based on Foata normal form. 789/66417 useless extension candidates. Maximal degree in co-relation 233559. Up to 71478 conditions per place. [2025-04-14 00:42:47,578 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 281 selfloop transitions, 10 changer transitions 6/297 dead transitions. [2025-04-14 00:42:47,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 297 transitions, 2351 flow [2025-04-14 00:42:47,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:42:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:42:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-14 00:42:47,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-04-14 00:42:47,580 INFO L175 Difference]: Start difference. First operand has 126 places, 222 transitions, 1428 flow. Second operand 3 states and 165 transitions. [2025-04-14 00:42:47,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 297 transitions, 2351 flow [2025-04-14 00:42:49,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 297 transitions, 2326 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:42:49,128 INFO L231 Difference]: Finished difference. Result has 129 places, 232 transitions, 1581 flow [2025-04-14 00:42:49,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=129, PETRI_TRANSITIONS=232} [2025-04-14 00:42:49,129 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2025-04-14 00:42:49,129 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 232 transitions, 1581 flow [2025-04-14 00:42:49,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:42:49,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:42:49,129 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:42:49,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:42:49,130 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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:42:49,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:42:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 877815901, now seen corresponding path program 1 times [2025-04-14 00:42:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:42:49,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185682754] [2025-04-14 00:42:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:42:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:42:49,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:42:49,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:42:49,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:42:49,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:42:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:42:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:42:50,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185682754] [2025-04-14 00:42:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185682754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:42:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:42:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:42:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622231624] [2025-04-14 00:42:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:42:50,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:42:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:42:50,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:42:50,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:42:50,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:42:50,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 232 transitions, 1581 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:42:50,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:42:50,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:42:50,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:07,127 INFO L116 PetriNetUnfolderBase]: 65523/90598 cut-off events. [2025-04-14 00:43:07,127 INFO L117 PetriNetUnfolderBase]: For 108775/108775 co-relation queries the response was YES. [2025-04-14 00:43:07,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242179 conditions, 90598 events. 65523/90598 cut-off events. For 108775/108775 co-relation queries the response was YES. Maximal size of possible extension queue 4651. Compared 618017 event pairs, 21400 based on Foata normal form. 1808/68786 useless extension candidates. Maximal degree in co-relation 242157. Up to 36573 conditions per place. [2025-04-14 00:43:07,791 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 309 selfloop transitions, 46 changer transitions 11/366 dead transitions. [2025-04-14 00:43:07,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 366 transitions, 2655 flow [2025-04-14 00:43:07,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-04-14 00:43:07,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2025-04-14 00:43:07,792 INFO L175 Difference]: Start difference. First operand has 129 places, 232 transitions, 1581 flow. Second operand 5 states and 269 transitions. [2025-04-14 00:43:07,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 366 transitions, 2655 flow [2025-04-14 00:43:08,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 366 transitions, 2621 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-14 00:43:08,787 INFO L231 Difference]: Finished difference. Result has 135 places, 236 transitions, 1781 flow [2025-04-14 00:43:08,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1781, PETRI_PLACES=135, PETRI_TRANSITIONS=236} [2025-04-14 00:43:08,787 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 57 predicate places. [2025-04-14 00:43:08,787 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 236 transitions, 1781 flow [2025-04-14 00:43:08,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:08,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:08,788 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:43:08,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:43:08,788 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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:43:08,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 357944681, now seen corresponding path program 2 times [2025-04-14 00:43:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:08,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601464522] [2025-04-14 00:43:08,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:08,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:43:08,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:43:08,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:43:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:43:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:09,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601464522] [2025-04-14 00:43:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601464522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563434880] [2025-04-14 00:43:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:09,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:43:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:09,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:43:09,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:43:09,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:43:09,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 236 transitions, 1781 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:09,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:09,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:43:09,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:21,244 INFO L116 PetriNetUnfolderBase]: 50118/69901 cut-off events. [2025-04-14 00:43:21,245 INFO L117 PetriNetUnfolderBase]: For 156333/156333 co-relation queries the response was YES. [2025-04-14 00:43:21,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191266 conditions, 69901 events. 50118/69901 cut-off events. For 156333/156333 co-relation queries the response was YES. Maximal size of possible extension queue 3624. Compared 475110 event pairs, 19443 based on Foata normal form. 2595/52449 useless extension candidates. Maximal degree in co-relation 191241. Up to 34013 conditions per place. [2025-04-14 00:43:21,727 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 297 selfloop transitions, 10 changer transitions 20/327 dead transitions. [2025-04-14 00:43:21,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 327 transitions, 2758 flow [2025-04-14 00:43:21,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:43:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:43:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-04-14 00:43:21,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2025-04-14 00:43:21,729 INFO L175 Difference]: Start difference. First operand has 135 places, 236 transitions, 1781 flow. Second operand 4 states and 214 transitions. [2025-04-14 00:43:21,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 327 transitions, 2758 flow [2025-04-14 00:43:22,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 327 transitions, 2656 flow, removed 41 selfloop flow, removed 2 redundant places. [2025-04-14 00:43:22,372 INFO L231 Difference]: Finished difference. Result has 139 places, 235 transitions, 1744 flow [2025-04-14 00:43:22,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1744, PETRI_PLACES=139, PETRI_TRANSITIONS=235} [2025-04-14 00:43:22,373 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 61 predicate places. [2025-04-14 00:43:22,373 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 235 transitions, 1744 flow [2025-04-14 00:43:22,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:22,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:22,373 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:43:22,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:43:22,373 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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:43:22,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1692025349, now seen corresponding path program 3 times [2025-04-14 00:43:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:22,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331093541] [2025-04-14 00:43:22,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:43:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:22,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:43:22,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:43:22,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:43:22,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:43:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:22,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331093541] [2025-04-14 00:43:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331093541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:22,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684492421] [2025-04-14 00:43:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:22,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:43:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:22,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:43:22,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:43:22,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:43:22,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 235 transitions, 1744 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:22,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:22,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:43:22,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:34,869 INFO L116 PetriNetUnfolderBase]: 50513/70556 cut-off events. [2025-04-14 00:43:34,869 INFO L117 PetriNetUnfolderBase]: For 113774/113774 co-relation queries the response was YES. [2025-04-14 00:43:35,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195607 conditions, 70556 events. 50513/70556 cut-off events. For 113774/113774 co-relation queries the response was YES. Maximal size of possible extension queue 3672. Compared 479626 event pairs, 26163 based on Foata normal form. 177/50478 useless extension candidates. Maximal degree in co-relation 195581. Up to 42173 conditions per place. [2025-04-14 00:43:35,364 INFO L140 encePairwiseOnDemand]: 94/108 looper letters, 289 selfloop transitions, 19 changer transitions 16/324 dead transitions. [2025-04-14 00:43:35,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 324 transitions, 2609 flow [2025-04-14 00:43:35,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:43:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:43:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-04-14 00:43:35,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2025-04-14 00:43:35,365 INFO L175 Difference]: Start difference. First operand has 139 places, 235 transitions, 1744 flow. Second operand 4 states and 214 transitions. [2025-04-14 00:43:35,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 324 transitions, 2609 flow [2025-04-14 00:43:35,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 324 transitions, 2600 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:43:35,947 INFO L231 Difference]: Finished difference. Result has 142 places, 237 transitions, 1821 flow [2025-04-14 00:43:35,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1821, PETRI_PLACES=142, PETRI_TRANSITIONS=237} [2025-04-14 00:43:35,947 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 64 predicate places. [2025-04-14 00:43:35,947 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 237 transitions, 1821 flow [2025-04-14 00:43:35,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:35,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:35,948 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:43:35,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:43:35,948 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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:43:35,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1428117301, now seen corresponding path program 1 times [2025-04-14 00:43:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:35,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555101846] [2025-04-14 00:43:35,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:43:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:35,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:43:36,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:43:36,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:43:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:43:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:36,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555101846] [2025-04-14 00:43:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555101846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:43:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557321022] [2025-04-14 00:43:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:36,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:43:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:36,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:43:36,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:43:36,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:43:36,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 237 transitions, 1821 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:36,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:36,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:43:36,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:49,278 INFO L116 PetriNetUnfolderBase]: 50386/70380 cut-off events. [2025-04-14 00:43:49,279 INFO L117 PetriNetUnfolderBase]: For 136164/136164 co-relation queries the response was YES. [2025-04-14 00:43:49,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199184 conditions, 70380 events. 50386/70380 cut-off events. For 136164/136164 co-relation queries the response was YES. Maximal size of possible extension queue 3650. Compared 477333 event pairs, 37934 based on Foata normal form. 1/50192 useless extension candidates. Maximal degree in co-relation 199157. Up to 65948 conditions per place. [2025-04-14 00:43:49,847 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 261 selfloop transitions, 6 changer transitions 23/290 dead transitions. [2025-04-14 00:43:49,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 290 transitions, 2638 flow [2025-04-14 00:43:49,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:43:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:43:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-04-14 00:43:49,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2025-04-14 00:43:49,849 INFO L175 Difference]: Start difference. First operand has 142 places, 237 transitions, 1821 flow. Second operand 4 states and 154 transitions. [2025-04-14 00:43:49,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 290 transitions, 2638 flow [2025-04-14 00:43:50,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 290 transitions, 2620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:43:50,598 INFO L231 Difference]: Finished difference. Result has 145 places, 232 transitions, 1763 flow [2025-04-14 00:43:50,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1763, PETRI_PLACES=145, PETRI_TRANSITIONS=232} [2025-04-14 00:43:50,599 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 67 predicate places. [2025-04-14 00:43:50,599 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 232 transitions, 1763 flow [2025-04-14 00:43:50,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:50,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:50,600 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:43:50,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 00:43:50,600 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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:43:50,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1414074697, now seen corresponding path program 2 times [2025-04-14 00:43:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:50,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343587076] [2025-04-14 00:43:50,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:50,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:43:50,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:43:50,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:43:50,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:43:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:51,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343587076] [2025-04-14 00:43:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343587076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:43:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073059238] [2025-04-14 00:43:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:51,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:43:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:51,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:43:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:43:51,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:43:51,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 232 transitions, 1763 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:43:51,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:51,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:43:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,384 INFO L116 PetriNetUnfolderBase]: 50054/69864 cut-off events. [2025-04-14 00:44:03,384 INFO L117 PetriNetUnfolderBase]: For 125819/125819 co-relation queries the response was YES. [2025-04-14 00:44:03,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197938 conditions, 69864 events. 50054/69864 cut-off events. For 125819/125819 co-relation queries the response was YES. Maximal size of possible extension queue 3599. Compared 471288 event pairs, 39318 based on Foata normal form. 1/49774 useless extension candidates. Maximal degree in co-relation 197910. Up to 68695 conditions per place. [2025-04-14 00:44:03,933 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 237 selfloop transitions, 4 changer transitions 23/264 dead transitions. [2025-04-14 00:44:03,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 264 transitions, 2404 flow [2025-04-14 00:44:03,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-04-14 00:44:03,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3287037037037037 [2025-04-14 00:44:03,934 INFO L175 Difference]: Start difference. First operand has 145 places, 232 transitions, 1763 flow. Second operand 4 states and 142 transitions. [2025-04-14 00:44:03,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 264 transitions, 2404 flow [2025-04-14 00:44:04,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 264 transitions, 2389 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:04,473 INFO L231 Difference]: Finished difference. Result has 146 places, 229 transitions, 1728 flow [2025-04-14 00:44:04,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1728, PETRI_PLACES=146, PETRI_TRANSITIONS=229} [2025-04-14 00:44:04,474 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 68 predicate places. [2025-04-14 00:44:04,474 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 229 transitions, 1728 flow [2025-04-14 00:44:04,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:44:04,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:04,474 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:44:04,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:44:04,474 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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:44:04,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1865553805, now seen corresponding path program 1 times [2025-04-14 00:44:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:04,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730322775] [2025-04-14 00:44:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:44:05,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:44:05,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:05,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:44:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:05,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730322775] [2025-04-14 00:44:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730322775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068964422] [2025-04-14 00:44:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:05,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:44:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:44:05,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:44:05,881 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:44:05,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 229 transitions, 1728 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:44:05,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:05,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:44:05,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:19,007 INFO L116 PetriNetUnfolderBase]: 52583/73716 cut-off events. [2025-04-14 00:44:19,007 INFO L117 PetriNetUnfolderBase]: For 124795/124795 co-relation queries the response was YES. [2025-04-14 00:44:19,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207702 conditions, 73716 events. 52583/73716 cut-off events. For 124795/124795 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 514559 event pairs, 13705 based on Foata normal form. 4/53023 useless extension candidates. Maximal degree in co-relation 207674. Up to 51590 conditions per place. [2025-04-14 00:44:19,572 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 296 selfloop transitions, 25 changer transitions 24/345 dead transitions. [2025-04-14 00:44:19,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 345 transitions, 2941 flow [2025-04-14 00:44:19,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:44:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:44:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-04-14 00:44:19,574 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3395061728395062 [2025-04-14 00:44:19,574 INFO L175 Difference]: Start difference. First operand has 146 places, 229 transitions, 1728 flow. Second operand 6 states and 220 transitions. [2025-04-14 00:44:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 345 transitions, 2941 flow [2025-04-14 00:44:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 345 transitions, 2929 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:20,222 INFO L231 Difference]: Finished difference. Result has 151 places, 231 transitions, 1827 flow [2025-04-14 00:44:20,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1827, PETRI_PLACES=151, PETRI_TRANSITIONS=231} [2025-04-14 00:44:20,223 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 73 predicate places. [2025-04-14 00:44:20,223 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 231 transitions, 1827 flow [2025-04-14 00:44:20,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:44:20,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:20,223 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:44:20,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:44:20,224 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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:44:20,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1546560965, now seen corresponding path program 1 times [2025-04-14 00:44:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:20,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832564189] [2025-04-14 00:44:20,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-14 00:44:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:44:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:44:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:20,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832564189] [2025-04-14 00:44:20,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832564189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:20,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114653992] [2025-04-14 00:44:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:20,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:20,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:20,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:20,994 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:44:20,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 231 transitions, 1827 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:44:20,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:20,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:44:20,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:33,213 INFO L116 PetriNetUnfolderBase]: 49883/70803 cut-off events. [2025-04-14 00:44:33,213 INFO L117 PetriNetUnfolderBase]: For 172553/172553 co-relation queries the response was YES. [2025-04-14 00:44:33,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195501 conditions, 70803 events. 49883/70803 cut-off events. For 172553/172553 co-relation queries the response was YES. Maximal size of possible extension queue 3564. Compared 502353 event pairs, 19568 based on Foata normal form. 1612/52063 useless extension candidates. Maximal degree in co-relation 195471. Up to 31897 conditions per place. [2025-04-14 00:44:33,745 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 293 selfloop transitions, 17 changer transitions 20/330 dead transitions. [2025-04-14 00:44:33,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 330 transitions, 2931 flow [2025-04-14 00:44:33,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-04-14 00:44:33,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5023148148148148 [2025-04-14 00:44:33,746 INFO L175 Difference]: Start difference. First operand has 151 places, 231 transitions, 1827 flow. Second operand 4 states and 217 transitions. [2025-04-14 00:44:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 330 transitions, 2931 flow [2025-04-14 00:44:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 330 transitions, 2890 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:34,597 INFO L231 Difference]: Finished difference. Result has 154 places, 235 transitions, 1996 flow [2025-04-14 00:44:34,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1721, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1996, PETRI_PLACES=154, PETRI_TRANSITIONS=235} [2025-04-14 00:44:34,598 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2025-04-14 00:44:34,598 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 235 transitions, 1996 flow [2025-04-14 00:44:34,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:44:34,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:34,598 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:44:34,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 00:44:34,598 INFO L403 AbstractCegarLoop]: === Iteration 24 === 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:44:34,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1007316483, now seen corresponding path program 2 times [2025-04-14 00:44:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:34,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267308577] [2025-04-14 00:44:34,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:44:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:34,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:44:34,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:44:34,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:34,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:44:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:35,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267308577] [2025-04-14 00:44:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267308577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572012934] [2025-04-14 00:44:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:35,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:44:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:44:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:44:35,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:44:35,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 235 transitions, 1996 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:44:35,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:35,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:44:35,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:47,817 INFO L116 PetriNetUnfolderBase]: 49409/70087 cut-off events. [2025-04-14 00:44:47,818 INFO L117 PetriNetUnfolderBase]: For 166961/166961 co-relation queries the response was YES. [2025-04-14 00:44:48,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198194 conditions, 70087 events. 49409/70087 cut-off events. For 166961/166961 co-relation queries the response was YES. Maximal size of possible extension queue 3495. Compared 493115 event pairs, 25465 based on Foata normal form. 2/49917 useless extension candidates. Maximal degree in co-relation 198163. Up to 40646 conditions per place. [2025-04-14 00:44:48,346 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 263 selfloop transitions, 22 changer transitions 28/313 dead transitions. [2025-04-14 00:44:48,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 313 transitions, 2798 flow [2025-04-14 00:44:48,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-04-14 00:44:48,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3685185185185185 [2025-04-14 00:44:48,351 INFO L175 Difference]: Start difference. First operand has 154 places, 235 transitions, 1996 flow. Second operand 5 states and 199 transitions. [2025-04-14 00:44:48,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 313 transitions, 2798 flow [2025-04-14 00:44:49,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 313 transitions, 2798 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:44:49,396 INFO L231 Difference]: Finished difference. Result has 159 places, 233 transitions, 2006 flow [2025-04-14 00:44:49,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2006, PETRI_PLACES=159, PETRI_TRANSITIONS=233} [2025-04-14 00:44:49,397 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 81 predicate places. [2025-04-14 00:44:49,397 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 233 transitions, 2006 flow [2025-04-14 00:44:49,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:44:49,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:49,397 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:44:49,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 00:44:49,397 INFO L403 AbstractCegarLoop]: === Iteration 25 === 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:44:49,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1835400899, now seen corresponding path program 4 times [2025-04-14 00:44:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:49,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134121342] [2025-04-14 00:44:49,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:49,469 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:44:49,583 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:44:49,584 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:44:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:44:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:50,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134121342] [2025-04-14 00:44:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134121342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185813462] [2025-04-14 00:44:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:50,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:50,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:50,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:50,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:44:50,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 233 transitions, 2006 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:44:50,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:50,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:44:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:02,257 INFO L116 PetriNetUnfolderBase]: 47550/67362 cut-off events. [2025-04-14 00:45:02,257 INFO L117 PetriNetUnfolderBase]: For 169094/169094 co-relation queries the response was YES. [2025-04-14 00:45:02,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190555 conditions, 67362 events. 47550/67362 cut-off events. For 169094/169094 co-relation queries the response was YES. Maximal size of possible extension queue 3375. Compared 473650 event pairs, 14127 based on Foata normal form. 213/48121 useless extension candidates. Maximal degree in co-relation 190522. Up to 33847 conditions per place. [2025-04-14 00:45:02,837 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 266 selfloop transitions, 38 changer transitions 16/320 dead transitions. [2025-04-14 00:45:02,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 320 transitions, 2925 flow [2025-04-14 00:45:02,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:45:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:45:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-04-14 00:45:02,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2025-04-14 00:45:02,839 INFO L175 Difference]: Start difference. First operand has 159 places, 233 transitions, 2006 flow. Second operand 4 states and 209 transitions. [2025-04-14 00:45:02,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 320 transitions, 2925 flow [2025-04-14 00:45:04,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 320 transitions, 2877 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:45:04,209 INFO L231 Difference]: Finished difference. Result has 160 places, 235 transitions, 2127 flow [2025-04-14 00:45:04,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2127, PETRI_PLACES=160, PETRI_TRANSITIONS=235} [2025-04-14 00:45:04,210 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2025-04-14 00:45:04,210 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 235 transitions, 2127 flow [2025-04-14 00:45:04,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:45:04,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:04,210 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:45:04,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 00:45:04,210 INFO L403 AbstractCegarLoop]: === Iteration 26 === 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:45:04,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -104851453, now seen corresponding path program 5 times [2025-04-14 00:45:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:04,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74347936] [2025-04-14 00:45:04,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:04,256 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:45:04,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:45:04,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-14 00:45:04,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:45:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:05,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74347936] [2025-04-14 00:45:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74347936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:05,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385554097] [2025-04-14 00:45:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:05,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:45:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:05,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:45:05,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:45:05,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:45:05,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 235 transitions, 2127 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:45:05,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:05,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:45:05,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:14,746 INFO L116 PetriNetUnfolderBase]: 40328/57167 cut-off events. [2025-04-14 00:45:14,746 INFO L117 PetriNetUnfolderBase]: For 189209/189209 co-relation queries the response was YES. [2025-04-14 00:45:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164740 conditions, 57167 events. 40328/57167 cut-off events. For 189209/189209 co-relation queries the response was YES. Maximal size of possible extension queue 3029. Compared 393894 event pairs, 17574 based on Foata normal form. 634/40743 useless extension candidates. Maximal degree in co-relation 164707. Up to 30077 conditions per place. [2025-04-14 00:45:15,206 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 266 selfloop transitions, 17 changer transitions 13/296 dead transitions. [2025-04-14 00:45:15,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 296 transitions, 2878 flow [2025-04-14 00:45:15,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:45:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:45:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2025-04-14 00:45:15,208 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-14 00:45:15,208 INFO L175 Difference]: Start difference. First operand has 160 places, 235 transitions, 2127 flow. Second operand 4 states and 184 transitions. [2025-04-14 00:45:15,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 296 transitions, 2878 flow [2025-04-14 00:45:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 296 transitions, 2786 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-04-14 00:45:15,965 INFO L231 Difference]: Finished difference. Result has 161 places, 235 transitions, 2125 flow [2025-04-14 00:45:15,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2125, PETRI_PLACES=161, PETRI_TRANSITIONS=235} [2025-04-14 00:45:15,966 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2025-04-14 00:45:15,966 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 235 transitions, 2125 flow [2025-04-14 00:45:15,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:45:15,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:15,966 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:45:15,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 00:45:15,966 INFO L403 AbstractCegarLoop]: === Iteration 27 === 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:45:15,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1230367107, now seen corresponding path program 6 times [2025-04-14 00:45:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:15,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024298724] [2025-04-14 00:45:15,967 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:16,010 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:45:16,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:45:16,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:45:16,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:45:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:16,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024298724] [2025-04-14 00:45:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024298724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507761574] [2025-04-14 00:45:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:16,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:45:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:16,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:45:16,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:45:16,353 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:45:16,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 235 transitions, 2125 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:45:16,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:16,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:45:16,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:26,306 INFO L116 PetriNetUnfolderBase]: 40221/57026 cut-off events. [2025-04-14 00:45:26,307 INFO L117 PetriNetUnfolderBase]: For 141956/141956 co-relation queries the response was YES. [2025-04-14 00:45:26,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161524 conditions, 57026 events. 40221/57026 cut-off events. For 141956/141956 co-relation queries the response was YES. Maximal size of possible extension queue 3063. Compared 394815 event pairs, 10435 based on Foata normal form. 88/40002 useless extension candidates. Maximal degree in co-relation 161490. Up to 29269 conditions per place. [2025-04-14 00:45:26,762 INFO L140 encePairwiseOnDemand]: 89/108 looper letters, 255 selfloop transitions, 37 changer transitions 30/322 dead transitions. [2025-04-14 00:45:26,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 322 transitions, 2950 flow [2025-04-14 00:45:26,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-04-14 00:45:26,763 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2025-04-14 00:45:26,764 INFO L175 Difference]: Start difference. First operand has 161 places, 235 transitions, 2125 flow. Second operand 5 states and 219 transitions. [2025-04-14 00:45:26,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 322 transitions, 2950 flow [2025-04-14 00:45:27,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 322 transitions, 2932 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:27,612 INFO L231 Difference]: Finished difference. Result has 166 places, 235 transitions, 2208 flow [2025-04-14 00:45:27,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2208, PETRI_PLACES=166, PETRI_TRANSITIONS=235} [2025-04-14 00:45:27,613 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 88 predicate places. [2025-04-14 00:45:27,613 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 235 transitions, 2208 flow [2025-04-14 00:45:27,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:45:27,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:27,613 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:45:27,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 00:45:27,613 INFO L403 AbstractCegarLoop]: === Iteration 28 === 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:45:27,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1273772987, now seen corresponding path program 3 times [2025-04-14 00:45:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:27,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956161233] [2025-04-14 00:45:27,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:27,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:45:27,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:45:27,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:27,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:45:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:28,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956161233] [2025-04-14 00:45:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956161233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649811894] [2025-04-14 00:45:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:28,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:28,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:28,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:28,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:45:28,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 235 transitions, 2208 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:45:28,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:28,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:45:28,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:41,250 INFO L116 PetriNetUnfolderBase]: 49058/69407 cut-off events. [2025-04-14 00:45:41,251 INFO L117 PetriNetUnfolderBase]: For 174591/174591 co-relation queries the response was YES. [2025-04-14 00:45:41,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192901 conditions, 69407 events. 49058/69407 cut-off events. For 174591/174591 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 483118 event pairs, 23322 based on Foata normal form. 2/49082 useless extension candidates. Maximal degree in co-relation 192865. Up to 39454 conditions per place. [2025-04-14 00:45:41,918 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 287 selfloop transitions, 21 changer transitions 31/339 dead transitions. [2025-04-14 00:45:41,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 339 transitions, 3285 flow [2025-04-14 00:45:41,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-04-14 00:45:41,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2025-04-14 00:45:41,920 INFO L175 Difference]: Start difference. First operand has 166 places, 235 transitions, 2208 flow. Second operand 5 states and 214 transitions. [2025-04-14 00:45:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 339 transitions, 3285 flow [2025-04-14 00:45:43,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 339 transitions, 3226 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:43,785 INFO L231 Difference]: Finished difference. Result has 172 places, 238 transitions, 2223 flow [2025-04-14 00:45:43,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2223, PETRI_PLACES=172, PETRI_TRANSITIONS=238} [2025-04-14 00:45:43,787 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2025-04-14 00:45:43,788 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 238 transitions, 2223 flow [2025-04-14 00:45:43,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:45:43,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:43,788 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:45:43,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:45:43,788 INFO L403 AbstractCegarLoop]: === Iteration 29 === 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:45:43,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1312554673, now seen corresponding path program 4 times [2025-04-14 00:45:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:43,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559057452] [2025-04-14 00:45:43,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:43,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:45:43,916 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:45:43,917 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:45:43,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:45:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:44,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559057452] [2025-04-14 00:45:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559057452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084875678] [2025-04-14 00:45:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:44,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:44,996 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:45:44,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 238 transitions, 2223 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:45:44,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:44,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:45:44,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:58,174 INFO L116 PetriNetUnfolderBase]: 51274/72845 cut-off events. [2025-04-14 00:45:58,175 INFO L117 PetriNetUnfolderBase]: For 177193/177193 co-relation queries the response was YES. [2025-04-14 00:45:58,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206227 conditions, 72845 events. 51274/72845 cut-off events. For 177193/177193 co-relation queries the response was YES. Maximal size of possible extension queue 3174. Compared 505417 event pairs, 36382 based on Foata normal form. 4/52118 useless extension candidates. Maximal degree in co-relation 206189. Up to 59761 conditions per place. [2025-04-14 00:45:58,884 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 289 selfloop transitions, 10 changer transitions 29/328 dead transitions. [2025-04-14 00:45:58,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 328 transitions, 3320 flow [2025-04-14 00:45:58,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2025-04-14 00:45:58,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30401234567901236 [2025-04-14 00:45:58,886 INFO L175 Difference]: Start difference. First operand has 172 places, 238 transitions, 2223 flow. Second operand 6 states and 197 transitions. [2025-04-14 00:45:58,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 328 transitions, 3320 flow [2025-04-14 00:46:00,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 328 transitions, 3242 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 00:46:00,328 INFO L231 Difference]: Finished difference. Result has 174 places, 238 transitions, 2196 flow [2025-04-14 00:46:00,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2196, PETRI_PLACES=174, PETRI_TRANSITIONS=238} [2025-04-14 00:46:00,329 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 96 predicate places. [2025-04-14 00:46:00,329 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 2196 flow [2025-04-14 00:46:00,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:46:00,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:00,329 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:46:00,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 00:46:00,329 INFO L403 AbstractCegarLoop]: === Iteration 30 === 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:46:00,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 410162683, now seen corresponding path program 2 times [2025-04-14 00:46:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:00,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729175695] [2025-04-14 00:46:00,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:46:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:00,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-14 00:46:00,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-14 00:46:00,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:46:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-14 00:46:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:00,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729175695] [2025-04-14 00:46:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729175695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:00,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278595262] [2025-04-14 00:46:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:00,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:46:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:00,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:46:00,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:46:00,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:46:00,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 2196 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:46:00,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:00,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:46:00,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:12,666 INFO L116 PetriNetUnfolderBase]: 49998/70876 cut-off events. [2025-04-14 00:46:12,666 INFO L117 PetriNetUnfolderBase]: For 166544/166544 co-relation queries the response was YES. [2025-04-14 00:46:13,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200369 conditions, 70876 events. 49998/70876 cut-off events. For 166544/166544 co-relation queries the response was YES. Maximal size of possible extension queue 3121. Compared 489208 event pairs, 22543 based on Foata normal form. 44/50486 useless extension candidates. Maximal degree in co-relation 200331. Up to 44696 conditions per place. [2025-04-14 00:46:13,317 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 266 selfloop transitions, 17 changer transitions 35/318 dead transitions. [2025-04-14 00:46:13,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 318 transitions, 3065 flow [2025-04-14 00:46:13,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:46:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:46:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-04-14 00:46:13,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2025-04-14 00:46:13,319 INFO L175 Difference]: Start difference. First operand has 174 places, 238 transitions, 2196 flow. Second operand 4 states and 203 transitions. [2025-04-14 00:46:13,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 318 transitions, 3065 flow [2025-04-14 00:46:14,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 318 transitions, 3021 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-04-14 00:46:14,505 INFO L231 Difference]: Finished difference. Result has 172 places, 232 transitions, 2124 flow [2025-04-14 00:46:14,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2124, PETRI_PLACES=172, PETRI_TRANSITIONS=232} [2025-04-14 00:46:14,506 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2025-04-14 00:46:14,506 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 232 transitions, 2124 flow [2025-04-14 00:46:14,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:46:14,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:14,506 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:46:14,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 00:46:14,507 INFO L403 AbstractCegarLoop]: === Iteration 31 === 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:46:14,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash 526857905, now seen corresponding path program 5 times [2025-04-14 00:46:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:14,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124516533] [2025-04-14 00:46:14,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:46:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:14,552 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 8 equivalence classes. [2025-04-14 00:46:15,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-04-14 00:46:15,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-14 00:46:15,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-04-14 00:46:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:17,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124516533] [2025-04-14 00:46:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124516533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:46:17,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534004231] [2025-04-14 00:46:17,439 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:46:17,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:46:17,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:46:17,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:46:18,178 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 8 equivalence classes. Received shutdown request... [2025-04-14 00:51:52,076 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:51:52,078 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:51:53,087 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 [2025-04-14 00:51:53,281 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-14 00:51:53,316 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 00:51:53,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:51:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-04-14 00:51:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933254774] [2025-04-14 00:51:53,316 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 00:51:53,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:51:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:51:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:51:53,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-14 00:51:53,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 232 transitions, 2124 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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:51:53,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:53,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-14 00:51:53,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-14 00:51:53,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:53,319 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:51:53,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 00:51:53,319 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 00:51:53,321 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:51:53,321 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:51:53,321 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:51:53,321 INFO L422 BasicCegarLoop]: Path program histogram: [6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:53,323 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:51:53,323 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:51:53,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:51:53 BasicIcfg [2025-04-14 00:51:53,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:51:53,326 INFO L158 Benchmark]: Toolchain (without parser) took 740022.11ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 108.1MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-14 00:51:53,326 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:53,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.62ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 80.5MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:51:53,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.88ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 68.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:51:53,327 INFO L158 Benchmark]: Boogie Preprocessor took 151.73ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 55.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:51:53,327 INFO L158 Benchmark]: IcfgBuilder took 4093.97ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 55.4MB in the beginning and 197.8MB in the end (delta: -142.4MB). Peak memory consumption was 233.1MB. Max. memory is 8.0GB. [2025-04-14 00:51:53,329 INFO L158 Benchmark]: TraceAbstraction took 735284.78ms. Allocated memory was 415.2MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 197.8MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 00:51:53,330 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 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 399.62ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 80.5MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.88ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 68.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 151.73ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 55.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgBuilder took 4093.97ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 55.4MB in the beginning and 197.8MB in the end (delta: -142.4MB). Peak memory consumption was 233.1MB. Max. memory is 8.0GB. * TraceAbstraction took 735284.78ms. Allocated memory was 415.2MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 197.8MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 344]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 338]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 336]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 124 locations, 183 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: 734.9s, OverallIterations: 31, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 372.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2056 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2056 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10464 IncrementalHoareTripleChecker+Invalid, 11053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 0 mSDtfsCounter, 10464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2223occurred in iteration=28, InterpolantAutomatonStates: 149, 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.5s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 3316 NumberOfCodeBlocks, 2458 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3491 ConstructedInterpolants, 0 QuantifiedInterpolants, 7974 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3525 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 10239/10443 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown