/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/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:33:01,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:33:01,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:33:01,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:33:01,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:33:01,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:33:01,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:33:01,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:33:01,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:33:01,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:33:01,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:33:01,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:33:01,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:33:01,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:33:01,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:33:01,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:01,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:01,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:33:01,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:33:01,850 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:33:02,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:33:02,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:33:02,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:33:02,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:33:02,057 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:33:02,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-14 01:33:03,377 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e78d1fb/17e20464eb9c43858691a1ef4f87fd71/FLAGb033bc8a5 [2025-04-14 01:33:03,580 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:33:03,580 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-14 01:33:03,589 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e78d1fb/17e20464eb9c43858691a1ef4f87fd71/FLAGb033bc8a5 [2025-04-14 01:33:04,378 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e78d1fb/17e20464eb9c43858691a1ef4f87fd71 [2025-04-14 01:33:04,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:33:04,381 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:33:04,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:04,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:33:04,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:33:04,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c709a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04, skipping insertion in model container [2025-04-14 01:33:04,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:33:04,540 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/popl20-simple-array-sum.wvr.c[2429,2442] [2025-04-14 01:33:04,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:04,556 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:33:04,581 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/popl20-simple-array-sum.wvr.c[2429,2442] [2025-04-14 01:33:04,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:04,592 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:33:04,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04 WrapperNode [2025-04-14 01:33:04,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:04,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:04,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:33:04,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:33:04,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,624 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-04-14 01:33:04,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:04,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:33:04,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:33:04,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:33:04,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,654 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 01:33:04,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:33:04,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:33:04,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:33:04,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:33:04,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (1/1) ... [2025-04-14 01:33:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:04,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:33:04,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:33:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:33:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:33:04,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:33:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:33:04,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:33:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:33:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:33:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:33:04,717 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:33:04,788 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:33:04,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:33:05,031 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:33:05,032 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:33:05,032 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:33:05,212 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:05,214 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:05,218 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:05,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:33:05,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:05 BoogieIcfgContainer [2025-04-14 01:33:05,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:33:05,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:33:05,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:33:05,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:33:05,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:33:04" (1/3) ... [2025-04-14 01:33:05,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4a004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:05, skipping insertion in model container [2025-04-14 01:33:05,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:04" (2/3) ... [2025-04-14 01:33:05,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4a004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:05, skipping insertion in model container [2025-04-14 01:33:05,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:05" (3/3) ... [2025-04-14 01:33:05,233 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-04-14 01:33:05,243 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:33:05,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 31 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 01:33:05,246 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:33:05,295 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:33:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 107 flow [2025-04-14 01:33:05,353 INFO L116 PetriNetUnfolderBase]: 12/40 cut-off events. [2025-04-14 01:33:05,356 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:05,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 12/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-04-14 01:33:05,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 107 flow [2025-04-14 01:33:05,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 39 transitions, 96 flow [2025-04-14 01:33:05,365 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:33:05,372 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;@6a3a2599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:33:05,372 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:33:05,388 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:33:05,388 INFO L116 PetriNetUnfolderBase]: 12/38 cut-off events. [2025-04-14 01:33:05,388 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:05,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:05,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:05,389 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 01:33:05,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1601908550, now seen corresponding path program 1 times [2025-04-14 01:33:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:05,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617600111] [2025-04-14 01:33:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:05,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:33:05,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:33:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:05,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617600111] [2025-04-14 01:33:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617600111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:33:05,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282308485] [2025-04-14 01:33:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:05,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:06,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:06,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:06,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:06,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:06,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:06,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:06,385 INFO L116 PetriNetUnfolderBase]: 2133/2869 cut-off events. [2025-04-14 01:33:06,386 INFO L117 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-04-14 01:33:06,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5919 conditions, 2869 events. 2133/2869 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11326 event pairs, 347 based on Foata normal form. 1/2001 useless extension candidates. Maximal degree in co-relation 5297. Up to 1697 conditions per place. [2025-04-14 01:33:06,405 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 67 selfloop transitions, 10 changer transitions 8/86 dead transitions. [2025-04-14 01:33:06,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 86 transitions, 381 flow [2025-04-14 01:33:06,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-14 01:33:06,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-04-14 01:33:06,416 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 96 flow. Second operand 4 states and 108 transitions. [2025-04-14 01:33:06,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 86 transitions, 381 flow [2025-04-14 01:33:06,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 86 transitions, 355 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:33:06,430 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 139 flow [2025-04-14 01:33:06,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2025-04-14 01:33:06,435 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-04-14 01:33:06,436 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 139 flow [2025-04-14 01:33:06,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:06,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:06,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:33:06,436 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 01:33:06,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -411492171, now seen corresponding path program 1 times [2025-04-14 01:33:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:06,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687890542] [2025-04-14 01:33:06,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:06,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:33:06,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:33:06,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:06,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:06,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687890542] [2025-04-14 01:33:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687890542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168818960] [2025-04-14 01:33:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:06,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:06,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:06,516 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:06,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:06,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:06,703 INFO L116 PetriNetUnfolderBase]: 1893/2615 cut-off events. [2025-04-14 01:33:06,703 INFO L117 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2025-04-14 01:33:06,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6337 conditions, 2615 events. 1893/2615 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10824 event pairs, 698 based on Foata normal form. 64/2282 useless extension candidates. Maximal degree in co-relation 4403. Up to 1835 conditions per place. [2025-04-14 01:33:06,714 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 56 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-04-14 01:33:06,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 321 flow [2025-04-14 01:33:06,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 01:33:06,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-04-14 01:33:06,716 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 139 flow. Second operand 3 states and 66 transitions. [2025-04-14 01:33:06,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 321 flow [2025-04-14 01:33:06,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 64 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:33:06,717 INFO L231 Difference]: Finished difference. Result has 38 places, 45 transitions, 180 flow [2025-04-14 01:33:06,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=38, PETRI_TRANSITIONS=45} [2025-04-14 01:33:06,718 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-14 01:33:06,718 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 45 transitions, 180 flow [2025-04-14 01:33:06,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:06,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:06,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:33:06,718 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 01:33:06,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2005107521, now seen corresponding path program 2 times [2025-04-14 01:33:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:06,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263081690] [2025-04-14 01:33:06,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:06,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:33:06,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:33:06,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:06,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263081690] [2025-04-14 01:33:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263081690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115752225] [2025-04-14 01:33:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:06,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:06,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:06,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:06,772 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:06,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 45 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:06,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:06,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:06,955 INFO L116 PetriNetUnfolderBase]: 1987/2808 cut-off events. [2025-04-14 01:33:06,955 INFO L117 PetriNetUnfolderBase]: For 1560/1560 co-relation queries the response was YES. [2025-04-14 01:33:06,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7592 conditions, 2808 events. 1987/2808 cut-off events. For 1560/1560 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11622 event pairs, 1038 based on Foata normal form. 89/2463 useless extension candidates. Maximal degree in co-relation 6228. Up to 1959 conditions per place. [2025-04-14 01:33:06,968 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 58 selfloop transitions, 5 changer transitions 3/67 dead transitions. [2025-04-14 01:33:06,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 371 flow [2025-04-14 01:33:06,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-14 01:33:06,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-04-14 01:33:06,969 INFO L175 Difference]: Start difference. First operand has 38 places, 45 transitions, 180 flow. Second operand 3 states and 72 transitions. [2025-04-14 01:33:06,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 371 flow [2025-04-14 01:33:06,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:06,975 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 199 flow [2025-04-14 01:33:06,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-04-14 01:33:06,975 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-14 01:33:06,975 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 199 flow [2025-04-14 01:33:06,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:06,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:06,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:06,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:33:06,976 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 01:33:06,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1140813647, now seen corresponding path program 3 times [2025-04-14 01:33:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:06,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878211335] [2025-04-14 01:33:06,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:06,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:33:06,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:33:06,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:33:06,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:07,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:07,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878211335] [2025-04-14 01:33:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878211335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:07,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545592862] [2025-04-14 01:33:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:07,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:07,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:07,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:07,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:07,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:07,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:07,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:07,197 INFO L116 PetriNetUnfolderBase]: 1429/2046 cut-off events. [2025-04-14 01:33:07,197 INFO L117 PetriNetUnfolderBase]: For 2547/2547 co-relation queries the response was YES. [2025-04-14 01:33:07,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5525 conditions, 2046 events. 1429/2046 cut-off events. For 2547/2547 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7959 event pairs, 454 based on Foata normal form. 188/1890 useless extension candidates. Maximal degree in co-relation 5298. Up to 1279 conditions per place. [2025-04-14 01:33:07,205 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 53 selfloop transitions, 8 changer transitions 8/70 dead transitions. [2025-04-14 01:33:07,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 386 flow [2025-04-14 01:33:07,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-14 01:33:07,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2025-04-14 01:33:07,207 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 199 flow. Second operand 4 states and 82 transitions. [2025-04-14 01:33:07,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 386 flow [2025-04-14 01:33:07,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 70 transitions, 367 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:07,209 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 155 flow [2025-04-14 01:33:07,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-14 01:33:07,210 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2025-04-14 01:33:07,210 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 155 flow [2025-04-14 01:33:07,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:07,210 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] [2025-04-14 01:33:07,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:33:07,210 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 01:33:07,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1213041926, now seen corresponding path program 1 times [2025-04-14 01:33:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:07,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578676448] [2025-04-14 01:33:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:07,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:33:07,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:33:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:07,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578676448] [2025-04-14 01:33:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578676448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:33:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999684891] [2025-04-14 01:33:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:07,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:07,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:07,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:07,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:07,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:07,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:07,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:07,381 INFO L116 PetriNetUnfolderBase]: 1360/1989 cut-off events. [2025-04-14 01:33:07,381 INFO L117 PetriNetUnfolderBase]: For 1738/1738 co-relation queries the response was YES. [2025-04-14 01:33:07,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5468 conditions, 1989 events. 1360/1989 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7504 event pairs, 390 based on Foata normal form. 52/1708 useless extension candidates. Maximal degree in co-relation 5458. Up to 1633 conditions per place. [2025-04-14 01:33:07,389 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 48 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-04-14 01:33:07,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 302 flow [2025-04-14 01:33:07,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-14 01:33:07,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2025-04-14 01:33:07,392 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 155 flow. Second operand 3 states and 54 transitions. [2025-04-14 01:33:07,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 302 flow [2025-04-14 01:33:07,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 287 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:07,394 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 148 flow [2025-04-14 01:33:07,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-04-14 01:33:07,396 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-14 01:33:07,396 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 148 flow [2025-04-14 01:33:07,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:07,397 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] [2025-04-14 01:33:07,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:33:07,397 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 01:33:07,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash -166420246, now seen corresponding path program 2 times [2025-04-14 01:33:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:07,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255174893] [2025-04-14 01:33:07,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:07,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:33:07,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:33:07,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:07,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:07,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255174893] [2025-04-14 01:33:07,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255174893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:07,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:07,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669894693] [2025-04-14 01:33:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:07,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:07,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:07,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:07,479 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:07,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 01:33:07,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:07,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:07,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:07,647 INFO L116 PetriNetUnfolderBase]: 1362/1987 cut-off events. [2025-04-14 01:33:07,647 INFO L117 PetriNetUnfolderBase]: For 1581/1581 co-relation queries the response was YES. [2025-04-14 01:33:07,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5579 conditions, 1987 events. 1362/1987 cut-off events. For 1581/1581 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7362 event pairs, 875 based on Foata normal form. 10/1661 useless extension candidates. Maximal degree in co-relation 1446. Up to 1928 conditions per place. [2025-04-14 01:33:07,657 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 36 selfloop transitions, 4 changer transitions 10/51 dead transitions. [2025-04-14 01:33:07,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 275 flow [2025-04-14 01:33:07,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-14 01:33:07,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29767441860465116 [2025-04-14 01:33:07,658 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 148 flow. Second operand 5 states and 64 transitions. [2025-04-14 01:33:07,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 275 flow [2025-04-14 01:33:07,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 271 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:07,660 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 172 flow [2025-04-14 01:33:07,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-04-14 01:33:07,661 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-04-14 01:33:07,661 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 172 flow [2025-04-14 01:33:07,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 01:33:07,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:07,661 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] [2025-04-14 01:33:07,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:33:07,661 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 01:33:07,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2145814644, now seen corresponding path program 1 times [2025-04-14 01:33:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:07,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167881431] [2025-04-14 01:33:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:33:07,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:33:07,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:07,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:07,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167881431] [2025-04-14 01:33:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167881431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202806111] [2025-04-14 01:33:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:07,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:07,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:07,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:07,952 INFO L116 PetriNetUnfolderBase]: 1595/2378 cut-off events. [2025-04-14 01:33:07,952 INFO L117 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2025-04-14 01:33:07,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2378 events. 1595/2378 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9169 event pairs, 425 based on Foata normal form. 66/2048 useless extension candidates. Maximal degree in co-relation 6560. Up to 1633 conditions per place. [2025-04-14 01:33:07,966 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 61 selfloop transitions, 5 changer transitions 2/69 dead transitions. [2025-04-14 01:33:07,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 417 flow [2025-04-14 01:33:07,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-14 01:33:07,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2025-04-14 01:33:07,967 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 172 flow. Second operand 4 states and 73 transitions. [2025-04-14 01:33:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 417 flow [2025-04-14 01:33:07,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 407 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:33:07,970 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 196 flow [2025-04-14 01:33:07,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-04-14 01:33:07,971 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-04-14 01:33:07,971 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 196 flow [2025-04-14 01:33:07,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:07,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:07,971 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:07,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:33:07,971 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 01:33:07,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -39471290, now seen corresponding path program 1 times [2025-04-14 01:33:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:07,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781724751] [2025-04-14 01:33:07,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:07,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 01:33:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:33:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:08,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:08,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781724751] [2025-04-14 01:33:08,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781724751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:08,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:08,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488362092] [2025-04-14 01:33:08,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:08,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:08,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:08,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:08,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:08,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:08,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:08,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:08,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:08,372 INFO L116 PetriNetUnfolderBase]: 1731/2625 cut-off events. [2025-04-14 01:33:08,372 INFO L117 PetriNetUnfolderBase]: For 2924/2924 co-relation queries the response was YES. [2025-04-14 01:33:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 2625 events. 1731/2625 cut-off events. For 2924/2924 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10952 event pairs, 828 based on Foata normal form. 5/2226 useless extension candidates. Maximal degree in co-relation 7781. Up to 1370 conditions per place. [2025-04-14 01:33:08,384 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 77 selfloop transitions, 6 changer transitions 10/94 dead transitions. [2025-04-14 01:33:08,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 571 flow [2025-04-14 01:33:08,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-14 01:33:08,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4511627906976744 [2025-04-14 01:33:08,385 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 196 flow. Second operand 5 states and 97 transitions. [2025-04-14 01:33:08,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 571 flow [2025-04-14 01:33:08,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:08,389 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 212 flow [2025-04-14 01:33:08,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2025-04-14 01:33:08,391 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-04-14 01:33:08,391 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 212 flow [2025-04-14 01:33:08,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:08,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:08,391 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:08,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:33:08,391 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 01:33:08,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 761772294, now seen corresponding path program 2 times [2025-04-14 01:33:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:08,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391024504] [2025-04-14 01:33:08,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:08,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:08,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:33:08,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:08,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:08,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391024504] [2025-04-14 01:33:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391024504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:08,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:33:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410934003] [2025-04-14 01:33:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:08,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:33:08,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:08,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:33:08,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:33:08,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:08,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:08,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:08,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:08,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:08,899 INFO L116 PetriNetUnfolderBase]: 2947/4354 cut-off events. [2025-04-14 01:33:08,899 INFO L117 PetriNetUnfolderBase]: For 8740/8740 co-relation queries the response was YES. [2025-04-14 01:33:08,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13774 conditions, 4354 events. 2947/4354 cut-off events. For 8740/8740 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 19155 event pairs, 825 based on Foata normal form. 60/4020 useless extension candidates. Maximal degree in co-relation 13737. Up to 2181 conditions per place. [2025-04-14 01:33:08,912 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 108 selfloop transitions, 32 changer transitions 0/141 dead transitions. [2025-04-14 01:33:08,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 141 transitions, 939 flow [2025-04-14 01:33:08,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:33:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:33:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2025-04-14 01:33:08,914 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41569767441860467 [2025-04-14 01:33:08,914 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 212 flow. Second operand 8 states and 143 transitions. [2025-04-14 01:33:08,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 141 transitions, 939 flow [2025-04-14 01:33:08,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 141 transitions, 897 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:33:08,921 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 514 flow [2025-04-14 01:33:08,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2025-04-14 01:33:08,922 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-04-14 01:33:08,922 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 514 flow [2025-04-14 01:33:08,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:08,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:08,922 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:08,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:33:08,922 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 01:33:08,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1899592614, now seen corresponding path program 3 times [2025-04-14 01:33:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:08,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087595452] [2025-04-14 01:33:08,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:08,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:08,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:33:08,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:08,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:09,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087595452] [2025-04-14 01:33:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087595452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964142905] [2025-04-14 01:33:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:09,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:09,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:09,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:09,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:09,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:09,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:09,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:09,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:09,400 INFO L116 PetriNetUnfolderBase]: 3438/5084 cut-off events. [2025-04-14 01:33:09,400 INFO L117 PetriNetUnfolderBase]: For 13104/13112 co-relation queries the response was YES. [2025-04-14 01:33:09,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18291 conditions, 5084 events. 3438/5084 cut-off events. For 13104/13112 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 23518 event pairs, 1169 based on Foata normal form. 30/4854 useless extension candidates. Maximal degree in co-relation 18250. Up to 2234 conditions per place. [2025-04-14 01:33:09,418 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 93 selfloop transitions, 31 changer transitions 2/127 dead transitions. [2025-04-14 01:33:09,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 127 transitions, 1072 flow [2025-04-14 01:33:09,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-04-14 01:33:09,419 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2025-04-14 01:33:09,419 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 514 flow. Second operand 5 states and 99 transitions. [2025-04-14 01:33:09,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 127 transitions, 1072 flow [2025-04-14 01:33:09,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 996 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:09,436 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 601 flow [2025-04-14 01:33:09,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2025-04-14 01:33:09,437 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2025-04-14 01:33:09,437 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 601 flow [2025-04-14 01:33:09,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:09,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:09,437 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:09,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:33:09,437 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 01:33:09,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1938744886, now seen corresponding path program 4 times [2025-04-14 01:33:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:09,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444402900] [2025-04-14 01:33:09,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:33:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:09,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:09,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-14 01:33:09,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:33:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:09,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444402900] [2025-04-14 01:33:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444402900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:09,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489030446] [2025-04-14 01:33:09,498 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:33:09,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:09,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:09,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:33:09,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:09,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-14 01:33:09,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:33:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:09,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 01:33:09,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:09,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489030446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:09,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-14 01:33:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311296585] [2025-04-14 01:33:09,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:09,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:33:09,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:09,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:33:09,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:33:09,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:09,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:09,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:09,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:09,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:10,091 INFO L116 PetriNetUnfolderBase]: 3312/4856 cut-off events. [2025-04-14 01:33:10,091 INFO L117 PetriNetUnfolderBase]: For 13508/13508 co-relation queries the response was YES. [2025-04-14 01:33:10,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17916 conditions, 4856 events. 3312/4856 cut-off events. For 13508/13508 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 21635 event pairs, 1351 based on Foata normal form. 32/4636 useless extension candidates. Maximal degree in co-relation 17873. Up to 2241 conditions per place. [2025-04-14 01:33:10,114 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 95 selfloop transitions, 34 changer transitions 1/131 dead transitions. [2025-04-14 01:33:10,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 1091 flow [2025-04-14 01:33:10,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-04-14 01:33:10,115 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4263565891472868 [2025-04-14 01:33:10,115 INFO L175 Difference]: Start difference. First operand has 64 places, 77 transitions, 601 flow. Second operand 6 states and 110 transitions. [2025-04-14 01:33:10,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 1091 flow [2025-04-14 01:33:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 131 transitions, 1051 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:10,135 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 665 flow [2025-04-14 01:33:10,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=665, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2025-04-14 01:33:10,136 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-04-14 01:33:10,136 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 665 flow [2025-04-14 01:33:10,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:10,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:10,136 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:10,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:33:10,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 01:33:10,337 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 01:33:10,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1876208944, now seen corresponding path program 5 times [2025-04-14 01:33:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:10,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531342587] [2025-04-14 01:33:10,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:33:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:10,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:10,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:33:10,363 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:33:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:10,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531342587] [2025-04-14 01:33:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531342587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:10,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517447297] [2025-04-14 01:33:10,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:33:10,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:10,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:10,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:33:10,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 01:33:10,531 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:33:10,531 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:33:10,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:33:10,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:33:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517447297] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:10,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:10,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-04-14 01:33:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430918939] [2025-04-14 01:33:10,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:10,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:33:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:10,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:33:10,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:33:10,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:10,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 665 flow. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:10,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:10,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:10,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:11,126 INFO L116 PetriNetUnfolderBase]: 3595/5401 cut-off events. [2025-04-14 01:33:11,126 INFO L117 PetriNetUnfolderBase]: For 17550/17550 co-relation queries the response was YES. [2025-04-14 01:33:11,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19664 conditions, 5401 events. 3595/5401 cut-off events. For 17550/17550 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 24822 event pairs, 2282 based on Foata normal form. 38/5163 useless extension candidates. Maximal degree in co-relation 17800. Up to 4727 conditions per place. [2025-04-14 01:33:11,145 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 75 selfloop transitions, 6 changer transitions 39/121 dead transitions. [2025-04-14 01:33:11,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 1149 flow [2025-04-14 01:33:11,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:33:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:33:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-04-14 01:33:11,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26098191214470284 [2025-04-14 01:33:11,148 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 665 flow. Second operand 9 states and 101 transitions. [2025-04-14 01:33:11,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 1149 flow [2025-04-14 01:33:11,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 1059 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 01:33:11,167 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 641 flow [2025-04-14 01:33:11,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=641, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2025-04-14 01:33:11,168 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2025-04-14 01:33:11,168 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 641 flow [2025-04-14 01:33:11,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:11,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:11,168 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:11,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:33:11,369 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,SelfDestructingSolverStorable11 [2025-04-14 01:33:11,369 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 01:33:11,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2111586240, now seen corresponding path program 6 times [2025-04-14 01:33:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:11,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010531177] [2025-04-14 01:33:11,370 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:33:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:11,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-14 01:33:11,391 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:33:11,391 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:33:11,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:33:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:11,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010531177] [2025-04-14 01:33:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010531177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037331505] [2025-04-14 01:33:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:11,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:11,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:11,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:11,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 641 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:11,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:11,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:11,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:11,789 INFO L116 PetriNetUnfolderBase]: 3287/4855 cut-off events. [2025-04-14 01:33:11,789 INFO L117 PetriNetUnfolderBase]: For 12228/12228 co-relation queries the response was YES. [2025-04-14 01:33:11,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16955 conditions, 4855 events. 3287/4855 cut-off events. For 12228/12228 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 22378 event pairs, 638 based on Foata normal form. 22/4629 useless extension candidates. Maximal degree in co-relation 16898. Up to 1885 conditions per place. [2025-04-14 01:33:11,811 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 106 selfloop transitions, 25 changer transitions 1/133 dead transitions. [2025-04-14 01:33:11,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 133 transitions, 1169 flow [2025-04-14 01:33:11,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-14 01:33:11,813 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2025-04-14 01:33:11,813 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 641 flow. Second operand 5 states and 93 transitions. [2025-04-14 01:33:11,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 133 transitions, 1169 flow [2025-04-14 01:33:11,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 133 transitions, 1143 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-14 01:33:11,832 INFO L231 Difference]: Finished difference. Result has 74 places, 89 transitions, 784 flow [2025-04-14 01:33:11,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2025-04-14 01:33:11,834 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2025-04-14 01:33:11,834 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 784 flow [2025-04-14 01:33:11,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:11,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:11,834 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-14 01:33:11,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:33:11,834 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 01:33:11,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash -939052622, now seen corresponding path program 7 times [2025-04-14 01:33:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:11,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532076078] [2025-04-14 01:33:11,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:33:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:11,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:33:11,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:33:11,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:11,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:33:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:11,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532076078] [2025-04-14 01:33:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532076078] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:11,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407002097] [2025-04-14 01:33:11,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:33:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:11,970 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 01:33:11,972 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 01:33:12,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:33:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:33:12,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:12,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:12,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:33:12,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:33:12,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:33:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407002097] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:33:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-04-14 01:33:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88892166] [2025-04-14 01:33:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:12,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:33:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:12,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:33:12,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:33:12,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:12,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 01:33:12,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:12,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:12,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:12,420 INFO L116 PetriNetUnfolderBase]: 2888/4319 cut-off events. [2025-04-14 01:33:12,420 INFO L117 PetriNetUnfolderBase]: For 17473/17473 co-relation queries the response was YES. [2025-04-14 01:33:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15573 conditions, 4319 events. 2888/4319 cut-off events. For 17473/17473 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19745 event pairs, 1089 based on Foata normal form. 254/4339 useless extension candidates. Maximal degree in co-relation 15520. Up to 2496 conditions per place. [2025-04-14 01:33:12,440 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 67 selfloop transitions, 28 changer transitions 0/96 dead transitions. [2025-04-14 01:33:12,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 903 flow [2025-04-14 01:33:12,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2025-04-14 01:33:12,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29069767441860467 [2025-04-14 01:33:12,441 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 784 flow. Second operand 6 states and 75 transitions. [2025-04-14 01:33:12,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 903 flow [2025-04-14 01:33:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 874 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 01:33:12,457 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 664 flow [2025-04-14 01:33:12,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2025-04-14 01:33:12,458 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2025-04-14 01:33:12,458 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 664 flow [2025-04-14 01:33:12,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 01:33:12,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:12,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-04-14 01:33:12,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:33:12,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:12,659 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 01:33:12,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1189346087, now seen corresponding path program 1 times [2025-04-14 01:33:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:12,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836070365] [2025-04-14 01:33:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:12,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:33:12,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:12,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:12,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:12,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836070365] [2025-04-14 01:33:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836070365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:12,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622489322] [2025-04-14 01:33:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:12,768 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 01:33:12,769 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 01:33:12,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:33:12,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:12,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:33:12,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:12,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622489322] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:12,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:33:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-14 01:33:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744719043] [2025-04-14 01:33:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:12,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:33:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:12,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:33:12,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:33:12,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:12,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:12,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:12,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:12,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:13,238 INFO L116 PetriNetUnfolderBase]: 3401/5035 cut-off events. [2025-04-14 01:33:13,238 INFO L117 PetriNetUnfolderBase]: For 17438/17438 co-relation queries the response was YES. [2025-04-14 01:33:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17893 conditions, 5035 events. 3401/5035 cut-off events. For 17438/17438 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22179 event pairs, 1667 based on Foata normal form. 0/4772 useless extension candidates. Maximal degree in co-relation 17840. Up to 3479 conditions per place. [2025-04-14 01:33:13,260 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 106 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2025-04-14 01:33:13,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 114 transitions, 1218 flow [2025-04-14 01:33:13,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-04-14 01:33:13,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2025-04-14 01:33:13,261 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 664 flow. Second operand 6 states and 72 transitions. [2025-04-14 01:33:13,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 114 transitions, 1218 flow [2025-04-14 01:33:13,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 1130 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:33:13,277 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 632 flow [2025-04-14 01:33:13,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2025-04-14 01:33:13,277 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2025-04-14 01:33:13,277 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 632 flow [2025-04-14 01:33:13,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:13,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:13,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-04-14 01:33:13,284 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 01:33:13,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:33:13,482 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 01:33:13,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash 85514626, now seen corresponding path program 1 times [2025-04-14 01:33:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:13,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801067162] [2025-04-14 01:33:13,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:13,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 01:33:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:33:13,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:13,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:33:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:13,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801067162] [2025-04-14 01:33:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801067162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:13,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760298470] [2025-04-14 01:33:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:13,542 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 01:33:13,543 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 01:33:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 01:33:13,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:33:13,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:13,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:13,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:33:13,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:33:13,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:33:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760298470] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:13,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-04-14 01:33:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202163433] [2025-04-14 01:33:13,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:13,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:33:13,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:13,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:33:13,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:33:13,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:13,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 632 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:13,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:13,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:13,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:14,112 INFO L116 PetriNetUnfolderBase]: 4671/7011 cut-off events. [2025-04-14 01:33:14,113 INFO L117 PetriNetUnfolderBase]: For 24545/24545 co-relation queries the response was YES. [2025-04-14 01:33:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25250 conditions, 7011 events. 4671/7011 cut-off events. For 24545/24545 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 33509 event pairs, 819 based on Foata normal form. 118/6816 useless extension candidates. Maximal degree in co-relation 25196. Up to 4225 conditions per place. [2025-04-14 01:33:14,143 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 145 selfloop transitions, 19 changer transitions 21/186 dead transitions. [2025-04-14 01:33:14,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 186 transitions, 1821 flow [2025-04-14 01:33:14,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:33:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:33:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-04-14 01:33:14,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4019933554817276 [2025-04-14 01:33:14,145 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 632 flow. Second operand 7 states and 121 transitions. [2025-04-14 01:33:14,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 186 transitions, 1821 flow [2025-04-14 01:33:14,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 186 transitions, 1806 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:33:14,163 INFO L231 Difference]: Finished difference. Result has 82 places, 91 transitions, 849 flow [2025-04-14 01:33:14,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=849, PETRI_PLACES=82, PETRI_TRANSITIONS=91} [2025-04-14 01:33:14,165 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2025-04-14 01:33:14,165 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 91 transitions, 849 flow [2025-04-14 01:33:14,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:14,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:14,165 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2025-04-14 01:33:14,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:33:14,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:33:14,365 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 01:33:14,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1614818620, now seen corresponding path program 2 times [2025-04-14 01:33:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:14,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525014492] [2025-04-14 01:33:14,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:14,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:33:14,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:33:14,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 01:33:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:14,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525014492] [2025-04-14 01:33:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525014492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:14,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887395764] [2025-04-14 01:33:14,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:14,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:14,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:33:14,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:33:14,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:33:14,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:14,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 01:33:14,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 01:33:14,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 01:33:14,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887395764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:14,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:14,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-14 01:33:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452142132] [2025-04-14 01:33:14,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:14,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:14,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:14,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:14,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 01:33:14,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 91 transitions, 849 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 01:33:14,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:14,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 01:33:14,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:14,962 INFO L116 PetriNetUnfolderBase]: 4100/6117 cut-off events. [2025-04-14 01:33:14,962 INFO L117 PetriNetUnfolderBase]: For 25859/25859 co-relation queries the response was YES. [2025-04-14 01:33:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23715 conditions, 6117 events. 4100/6117 cut-off events. For 25859/25859 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 28318 event pairs, 344 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 23659. Up to 3438 conditions per place. [2025-04-14 01:33:14,978 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 0 selfloop transitions, 0 changer transitions 147/147 dead transitions. [2025-04-14 01:33:14,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1495 flow [2025-04-14 01:33:14,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:33:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:33:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2025-04-14 01:33:14,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3521594684385382 [2025-04-14 01:33:14,979 INFO L175 Difference]: Start difference. First operand has 82 places, 91 transitions, 849 flow. Second operand 7 states and 106 transitions. [2025-04-14 01:33:14,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1495 flow [2025-04-14 01:33:15,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 147 transitions, 1419 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:15,004 INFO L231 Difference]: Finished difference. Result has 83 places, 0 transitions, 0 flow [2025-04-14 01:33:15,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=83, PETRI_TRANSITIONS=0} [2025-04-14 01:33:15,004 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2025-04-14 01:33:15,004 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 0 transitions, 0 flow [2025-04-14 01:33:15,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 01:33:15,006 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:33:15,006 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:33:15,006 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:33:15,007 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:33:15,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:33:15,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:33:15,208 INFO L422 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1] [2025-04-14 01:33:15,210 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:33:15,210 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:33:15,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:33:15 BasicIcfg [2025-04-14 01:33:15,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:33:15,213 INFO L158 Benchmark]: Toolchain (without parser) took 10832.16ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 119.3MB in the beginning and 268.3MB in the end (delta: -149.0MB). Peak memory consumption was 208.7MB. Max. memory is 8.0GB. [2025-04-14 01:33:15,213 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:33:15,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.36ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 104.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:33:15,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.85ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:33:15,214 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:33:15,214 INFO L158 Benchmark]: IcfgBuilder took 556.41ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 51.8MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-14 01:33:15,214 INFO L158 Benchmark]: TraceAbstraction took 9984.89ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 51.1MB in the beginning and 268.3MB in the end (delta: -217.2MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2025-04-14 01:33:15,215 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.22ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.36ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 104.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.85ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 556.41ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 51.8MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 9984.89ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 51.1MB in the beginning and 268.3MB in the end (delta: -217.2MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 73 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: 9.9s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 585 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2479 IncrementalHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 0 mSDtfsCounter, 2479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 440 SyntacticMatches, 17 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=849occurred in iteration=16, InterpolantAutomatonStates: 90, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 730 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 924 ConstructedInterpolants, 0 QuantifiedInterpolants, 2577 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1450 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 167/211 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 01:33:15,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...