/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-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:18:16,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:18:16,739 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:18:16,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:18:16,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:18:16,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:18:16,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:18:16,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:18:16,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:18:16,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:18:16,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:18:16,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:18:16,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:18:16,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:16,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:16,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:16,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:18:16,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:18:16,760 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:18:16,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:18:17,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:18:17,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:18:17,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:18:17,004 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:18:17,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2025-04-14 01:18:18,342 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a735a8/df8131aff0e9474bb8be0ab029757fa7/FLAGd862d639a [2025-04-14 01:18:18,608 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:18:18,608 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2025-04-14 01:18:18,614 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a735a8/df8131aff0e9474bb8be0ab029757fa7/FLAGd862d639a [2025-04-14 01:18:19,392 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a735a8/df8131aff0e9474bb8be0ab029757fa7 [2025-04-14 01:18:19,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:18:19,395 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:18:19,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:19,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:18:19,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:18:19,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19, skipping insertion in model container [2025-04-14 01:18:19,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:18:19,603 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-more-min-array.wvr.c[2592,2605] [2025-04-14 01:18:19,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:19,624 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:18:19,658 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-more-min-array.wvr.c[2592,2605] [2025-04-14 01:18:19,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:19,680 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:18:19,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19 WrapperNode [2025-04-14 01:18:19,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:19,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:19,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:18:19,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:18:19,688 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:18:19" (1/1) ... [2025-04-14 01:18:19,699 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:18:19" (1/1) ... [2025-04-14 01:18:19,720 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-04-14 01:18:19,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:19,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:18:19,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:18:19,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:18:19,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,746 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:18:19,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:18:19,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:18:19,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:18:19,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:18:19,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (1/1) ... [2025-04-14 01:18:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:19,801 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:18:19,804 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:18:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:18:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:18:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:18:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:18:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:18:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:18:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:18:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:18:19,824 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:18:19,917 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:18:19,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:18:20,140 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:18:20,141 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:18:20,141 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:18:20,319 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:18:20,321 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:18:20,323 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:18:20,327 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:18:20,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:20 BoogieIcfgContainer [2025-04-14 01:18:20,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:18:20,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:18:20,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:18:20,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:18:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:18:19" (1/3) ... [2025-04-14 01:18:20,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5c4fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:20, skipping insertion in model container [2025-04-14 01:18:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:19" (2/3) ... [2025-04-14 01:18:20,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5c4fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:20, skipping insertion in model container [2025-04-14 01:18:20,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:20" (3/3) ... [2025-04-14 01:18:20,335 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2025-04-14 01:18:20,348 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:18:20,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:18:20,349 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:18:20,408 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:18:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:18:20,487 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:18:20,488 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:20,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-14 01:18:20,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:18:20,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:18:20,500 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:18:20,511 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;@7c0fc2db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:18:20,511 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:18:20,524 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:18:20,524 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:18:20,524 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:20,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:20,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:20,525 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:18:20,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash -203059738, now seen corresponding path program 1 times [2025-04-14 01:18:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:20,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141844435] [2025-04-14 01:18:20,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:18:20,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:20,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:20,777 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:18:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:20,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141844435] [2025-04-14 01:18:20,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141844435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:20,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841717111] [2025-04-14 01:18:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:20,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:20,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:20,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:20,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:20,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:18:20,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:20,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:20,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:20,954 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-14 01:18:20,954 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-14 01:18:20,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1960 event pairs, 306 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-14 01:18:20,963 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-14 01:18:20,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-14 01:18:20,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:18:20,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:18:20,974 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:18:20,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-14 01:18:20,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:20,983 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-14 01:18:20,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-14 01:18:20,989 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-14 01:18:20,990 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-14 01:18:20,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:18:20,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:20,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:20,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:18:20,990 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:18:20,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1616618239, now seen corresponding path program 1 times [2025-04-14 01:18:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:20,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221601742] [2025-04-14 01:18:20,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:18:21,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:21,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:21,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:21,077 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:18:21,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:21,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221601742] [2025-04-14 01:18:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221601742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:21,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:21,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:21,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694982224] [2025-04-14 01:18:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:21,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:21,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:21,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:21,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:21,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:21,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:21,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:21,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:21,201 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-14 01:18:21,201 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:18:21,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 666 events. 474/666 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-14 01:18:21,207 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-14 01:18:21,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-14 01:18:21,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-14 01:18:21,208 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:18:21,208 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-14 01:18:21,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-14 01:18:21,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:21,209 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-14 01:18:21,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-14 01:18:21,210 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-14 01:18:21,210 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-14 01:18:21,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:21,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:21,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] [2025-04-14 01:18:21,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:18:21,210 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:18:21,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -856983612, now seen corresponding path program 1 times [2025-04-14 01:18:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:21,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153401017] [2025-04-14 01:18:21,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:21,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:18:21,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:18:21,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:21,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:21,310 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:18:21,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:21,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153401017] [2025-04-14 01:18:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153401017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:21,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:21,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:18:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718780306] [2025-04-14 01:18:21,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:21,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:21,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:21,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:21,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:21,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:18:21,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:21,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:21,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:21,412 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-14 01:18:21,413 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:18:21,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 667 events. 474/667 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1347. Up to 667 conditions per place. [2025-04-14 01:18:21,416 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-14 01:18:21,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-14 01:18:21,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:18:21,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:18:21,418 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:18:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-14 01:18:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:21,420 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-14 01:18:21,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-14 01:18:21,421 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-14 01:18:21,421 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-14 01:18:21,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:18:21,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:21,421 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] [2025-04-14 01:18:21,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:18:21,421 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:18:21,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1717149542, now seen corresponding path program 1 times [2025-04-14 01:18:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:21,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986820241] [2025-04-14 01:18:21,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:21,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:21,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:21,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:21,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:22,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986820241] [2025-04-14 01:18:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986820241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:22,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497155728] [2025-04-14 01:18:22,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:22,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:22,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:22,306 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:18:22,307 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:18:22,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:22,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:22,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:22,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:22,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:18:22,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:22,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:22,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:18:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:22,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:23,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:18:23,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:18:23,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:18:23,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:18:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497155728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:23,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-14 01:18:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507486556] [2025-04-14 01:18:23,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:23,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:18:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:18:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:18:23,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:23,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 72 flow. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:18:23,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:23,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:23,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:24,939 INFO L116 PetriNetUnfolderBase]: 955/1407 cut-off events. [2025-04-14 01:18:24,939 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-14 01:18:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1407 events. 955/1407 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5754 event pairs, 10 based on Foata normal form. 1/1146 useless extension candidates. Maximal degree in co-relation 2865. Up to 841 conditions per place. [2025-04-14 01:18:24,946 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 110 selfloop transitions, 67 changer transitions 1/178 dead transitions. [2025-04-14 01:18:24,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 178 transitions, 764 flow [2025-04-14 01:18:24,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:18:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:18:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 251 transitions. [2025-04-14 01:18:24,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3268229166666667 [2025-04-14 01:18:24,949 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 24 states and 251 transitions. [2025-04-14 01:18:24,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 178 transitions, 764 flow [2025-04-14 01:18:24,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 178 transitions, 760 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:24,952 INFO L231 Difference]: Finished difference. Result has 62 places, 92 transitions, 425 flow [2025-04-14 01:18:24,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=425, PETRI_PLACES=62, PETRI_TRANSITIONS=92} [2025-04-14 01:18:24,954 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2025-04-14 01:18:24,954 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 92 transitions, 425 flow [2025-04-14 01:18:24,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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:18:24,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:24,954 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] [2025-04-14 01:18:24,965 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:18:25,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:25,155 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:18:25,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 731997248, now seen corresponding path program 2 times [2025-04-14 01:18:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:25,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982839573] [2025-04-14 01:18:25,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:25,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:25,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:25,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:25,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:25,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982839573] [2025-04-14 01:18:25,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982839573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:25,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:25,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329965046] [2025-04-14 01:18:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:25,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:25,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:25,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:25,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:25,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:25,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 92 transitions, 425 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:25,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:25,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:25,837 INFO L116 PetriNetUnfolderBase]: 997/1480 cut-off events. [2025-04-14 01:18:25,837 INFO L117 PetriNetUnfolderBase]: For 1170/1170 co-relation queries the response was YES. [2025-04-14 01:18:25,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 1480 events. 997/1480 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6067 event pairs, 80 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 4728. Up to 1341 conditions per place. [2025-04-14 01:18:25,845 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 105 selfloop transitions, 30 changer transitions 4/139 dead transitions. [2025-04-14 01:18:25,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 139 transitions, 887 flow [2025-04-14 01:18:25,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:18:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:18:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2025-04-14 01:18:25,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-14 01:18:25,846 INFO L175 Difference]: Start difference. First operand has 62 places, 92 transitions, 425 flow. Second operand 11 states and 110 transitions. [2025-04-14 01:18:25,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 139 transitions, 887 flow [2025-04-14 01:18:25,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:25,853 INFO L231 Difference]: Finished difference. Result has 78 places, 112 transitions, 645 flow [2025-04-14 01:18:25,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=645, PETRI_PLACES=78, PETRI_TRANSITIONS=112} [2025-04-14 01:18:25,856 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2025-04-14 01:18:25,856 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 112 transitions, 645 flow [2025-04-14 01:18:25,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:25,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:25,857 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] [2025-04-14 01:18:25,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:18:25,857 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:18:25,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1038063004, now seen corresponding path program 3 times [2025-04-14 01:18:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:25,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541847067] [2025-04-14 01:18:25,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:25,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:25,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:25,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:25,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:26,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541847067] [2025-04-14 01:18:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541847067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:26,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974340152] [2025-04-14 01:18:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:26,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:26,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:26,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:26,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:26,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 112 transitions, 645 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:26,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:26,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:26,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:26,621 INFO L116 PetriNetUnfolderBase]: 1113/1660 cut-off events. [2025-04-14 01:18:26,621 INFO L117 PetriNetUnfolderBase]: For 2200/2200 co-relation queries the response was YES. [2025-04-14 01:18:26,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6030 conditions, 1660 events. 1113/1660 cut-off events. For 2200/2200 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7066 event pairs, 78 based on Foata normal form. 1/1446 useless extension candidates. Maximal degree in co-relation 5991. Up to 1456 conditions per place. [2025-04-14 01:18:26,630 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 124 selfloop transitions, 54 changer transitions 4/182 dead transitions. [2025-04-14 01:18:26,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 182 transitions, 1350 flow [2025-04-14 01:18:26,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:18:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:18:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2025-04-14 01:18:26,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-04-14 01:18:26,631 INFO L175 Difference]: Start difference. First operand has 78 places, 112 transitions, 645 flow. Second operand 13 states and 136 transitions. [2025-04-14 01:18:26,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 182 transitions, 1350 flow [2025-04-14 01:18:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 182 transitions, 1316 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:26,640 INFO L231 Difference]: Finished difference. Result has 97 places, 145 transitions, 1045 flow [2025-04-14 01:18:26,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1045, PETRI_PLACES=97, PETRI_TRANSITIONS=145} [2025-04-14 01:18:26,640 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2025-04-14 01:18:26,640 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 145 transitions, 1045 flow [2025-04-14 01:18:26,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:26,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:26,641 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] [2025-04-14 01:18:26,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:18:26,641 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:18:26,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1888759312, now seen corresponding path program 4 times [2025-04-14 01:18:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:26,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-04-14 01:18:26,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:26,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:26,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:26,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:26,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:27,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-04-14 01:18:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251232548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068667967] [2025-04-14 01:18:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:27,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:27,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:27,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:27,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:27,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 145 transitions, 1045 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:27,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:27,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:27,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:27,744 INFO L116 PetriNetUnfolderBase]: 1339/1984 cut-off events. [2025-04-14 01:18:27,744 INFO L117 PetriNetUnfolderBase]: For 4121/4121 co-relation queries the response was YES. [2025-04-14 01:18:27,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8179 conditions, 1984 events. 1339/1984 cut-off events. For 4121/4121 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8647 event pairs, 146 based on Foata normal form. 1/1712 useless extension candidates. Maximal degree in co-relation 8130. Up to 1673 conditions per place. [2025-04-14 01:18:27,756 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 142 selfloop transitions, 92 changer transitions 4/238 dead transitions. [2025-04-14 01:18:27,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 238 transitions, 2071 flow [2025-04-14 01:18:27,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:18:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:18:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 147 transitions. [2025-04-14 01:18:27,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-14 01:18:27,757 INFO L175 Difference]: Start difference. First operand has 97 places, 145 transitions, 1045 flow. Second operand 14 states and 147 transitions. [2025-04-14 01:18:27,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 238 transitions, 2071 flow [2025-04-14 01:18:27,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 238 transitions, 2025 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:27,774 INFO L231 Difference]: Finished difference. Result has 117 places, 201 transitions, 1784 flow [2025-04-14 01:18:27,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1784, PETRI_PLACES=117, PETRI_TRANSITIONS=201} [2025-04-14 01:18:27,775 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2025-04-14 01:18:27,775 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 201 transitions, 1784 flow [2025-04-14 01:18:27,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:27,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:27,775 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] [2025-04-14 01:18:27,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:18:27,776 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:18:27,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1154996746, now seen corresponding path program 5 times [2025-04-14 01:18:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:27,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207315112] [2025-04-14 01:18:27,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:27,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:27,790 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:27,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:28,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207315112] [2025-04-14 01:18:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207315112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:28,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530149808] [2025-04-14 01:18:28,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:28,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:28,207 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:18:28,209 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:18:28,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:28,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:28,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:28,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:28,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:18:28,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:28,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:28,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:18:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:28,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:28,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:18:28,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:18:28,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:18:28,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:18:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530149808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:28,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:18:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115482317] [2025-04-14 01:18:28,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:28,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:18:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:28,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:18:28,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:18:28,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:28,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 201 transitions, 1784 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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:18:28,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:28,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:28,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:32,413 INFO L116 PetriNetUnfolderBase]: 2706/4067 cut-off events. [2025-04-14 01:18:32,413 INFO L117 PetriNetUnfolderBase]: For 12013/12013 co-relation queries the response was YES. [2025-04-14 01:18:32,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19660 conditions, 4067 events. 2706/4067 cut-off events. For 12013/12013 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 21113 event pairs, 74 based on Foata normal form. 6/3669 useless extension candidates. Maximal degree in co-relation 19535. Up to 1732 conditions per place. [2025-04-14 01:18:32,447 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 286 selfloop transitions, 547 changer transitions 5/838 dead transitions. [2025-04-14 01:18:32,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 838 transitions, 8095 flow [2025-04-14 01:18:32,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-14 01:18:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-04-14 01:18:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 729 transitions. [2025-04-14 01:18:32,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3120719178082192 [2025-04-14 01:18:32,454 INFO L175 Difference]: Start difference. First operand has 117 places, 201 transitions, 1784 flow. Second operand 73 states and 729 transitions. [2025-04-14 01:18:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 838 transitions, 8095 flow [2025-04-14 01:18:32,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 838 transitions, 7666 flow, removed 186 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:32,575 INFO L231 Difference]: Finished difference. Result has 208 places, 647 transitions, 6950 flow [2025-04-14 01:18:32,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=6950, PETRI_PLACES=208, PETRI_TRANSITIONS=647} [2025-04-14 01:18:32,575 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2025-04-14 01:18:32,576 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 647 transitions, 6950 flow [2025-04-14 01:18:32,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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:18:32,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:32,576 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] [2025-04-14 01:18:32,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:18:32,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-14 01:18:32,777 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:18:32,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2093610226, now seen corresponding path program 6 times [2025-04-14 01:18:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:32,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904094422] [2025-04-14 01:18:32,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:32,782 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:32,790 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:32,790 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:32,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:33,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904094422] [2025-04-14 01:18:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904094422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373650525] [2025-04-14 01:18:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:33,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:33,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:33,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:33,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:33,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 647 transitions, 6950 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:33,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:33,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:33,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:33,705 INFO L116 PetriNetUnfolderBase]: 2728/4103 cut-off events. [2025-04-14 01:18:33,706 INFO L117 PetriNetUnfolderBase]: For 15826/15826 co-relation queries the response was YES. [2025-04-14 01:18:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23031 conditions, 4103 events. 2728/4103 cut-off events. For 15826/15826 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 21253 event pairs, 202 based on Foata normal form. 1/3739 useless extension candidates. Maximal degree in co-relation 22893. Up to 3849 conditions per place. [2025-04-14 01:18:33,733 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 583 selfloop transitions, 105 changer transitions 4/692 dead transitions. [2025-04-14 01:18:33,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 692 transitions, 8606 flow [2025-04-14 01:18:33,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:18:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:18:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-14 01:18:33,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2025-04-14 01:18:33,734 INFO L175 Difference]: Start difference. First operand has 208 places, 647 transitions, 6950 flow. Second operand 13 states and 126 transitions. [2025-04-14 01:18:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 692 transitions, 8606 flow [2025-04-14 01:18:33,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 692 transitions, 7549 flow, removed 482 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:33,955 INFO L231 Difference]: Finished difference. Result has 218 places, 664 transitions, 6318 flow [2025-04-14 01:18:33,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5925, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6318, PETRI_PLACES=218, PETRI_TRANSITIONS=664} [2025-04-14 01:18:33,956 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2025-04-14 01:18:33,956 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 664 transitions, 6318 flow [2025-04-14 01:18:33,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:33,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:33,957 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] [2025-04-14 01:18:33,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:18:33,957 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:18:33,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -538401506, now seen corresponding path program 7 times [2025-04-14 01:18:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:33,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423181626] [2025-04-14 01:18:33,957 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:33,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:33,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:33,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:33,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:34,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423181626] [2025-04-14 01:18:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423181626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:34,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542399137] [2025-04-14 01:18:34,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:34,306 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:18:34,308 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:18:34,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:34,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:34,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:34,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:18:34,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:34,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:34,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:18:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:34,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:35,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:18:35,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:18:35,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:18:35,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:18:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542399137] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:35,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:18:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772472311] [2025-04-14 01:18:35,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:35,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:18:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:35,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:18:35,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:18:35,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:35,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 664 transitions, 6318 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:18:35,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:35,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:35,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:37,359 INFO L116 PetriNetUnfolderBase]: 3570/5374 cut-off events. [2025-04-14 01:18:37,359 INFO L117 PetriNetUnfolderBase]: For 13564/13564 co-relation queries the response was YES. [2025-04-14 01:18:37,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27181 conditions, 5374 events. 3570/5374 cut-off events. For 13564/13564 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 29471 event pairs, 108 based on Foata normal form. 3/4877 useless extension candidates. Maximal degree in co-relation 27018. Up to 2481 conditions per place. [2025-04-14 01:18:37,394 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 332 selfloop transitions, 624 changer transitions 1/957 dead transitions. [2025-04-14 01:18:37,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 957 transitions, 10437 flow [2025-04-14 01:18:37,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:18:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 01:18:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 379 transitions. [2025-04-14 01:18:37,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3289930555555556 [2025-04-14 01:18:37,396 INFO L175 Difference]: Start difference. First operand has 218 places, 664 transitions, 6318 flow. Second operand 36 states and 379 transitions. [2025-04-14 01:18:37,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 957 transitions, 10437 flow [2025-04-14 01:18:37,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 957 transitions, 10197 flow, removed 92 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:37,558 INFO L231 Difference]: Finished difference. Result has 261 places, 846 transitions, 9791 flow [2025-04-14 01:18:37,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6119, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=9791, PETRI_PLACES=261, PETRI_TRANSITIONS=846} [2025-04-14 01:18:37,560 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2025-04-14 01:18:37,560 INFO L485 AbstractCegarLoop]: Abstraction has has 261 places, 846 transitions, 9791 flow [2025-04-14 01:18:37,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:18:37,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:37,561 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] [2025-04-14 01:18:37,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:18:37,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:37,765 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:18:37,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash -609418198, now seen corresponding path program 8 times [2025-04-14 01:18:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:37,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753713451] [2025-04-14 01:18:37,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:37,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:37,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:37,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:38,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753713451] [2025-04-14 01:18:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753713451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842166344] [2025-04-14 01:18:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:38,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:38,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:38,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:38,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 846 transitions, 9791 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:38,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:38,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:38,899 INFO L116 PetriNetUnfolderBase]: 3658/5528 cut-off events. [2025-04-14 01:18:38,899 INFO L117 PetriNetUnfolderBase]: For 20414/20414 co-relation queries the response was YES. [2025-04-14 01:18:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33246 conditions, 5528 events. 3658/5528 cut-off events. For 20414/20414 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 30650 event pairs, 268 based on Foata normal form. 2/5006 useless extension candidates. Maximal degree in co-relation 33066. Up to 5205 conditions per place. [2025-04-14 01:18:38,937 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 784 selfloop transitions, 124 changer transitions 5/913 dead transitions. [2025-04-14 01:18:38,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 913 transitions, 12368 flow [2025-04-14 01:18:38,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:18:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:18:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2025-04-14 01:18:38,938 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2025-04-14 01:18:38,939 INFO L175 Difference]: Start difference. First operand has 261 places, 846 transitions, 9791 flow. Second operand 11 states and 115 transitions. [2025-04-14 01:18:38,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 913 transitions, 12368 flow [2025-04-14 01:18:39,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 913 transitions, 11872 flow, removed 155 selfloop flow, removed 14 redundant places. [2025-04-14 01:18:39,217 INFO L231 Difference]: Finished difference. Result has 262 places, 881 transitions, 10235 flow [2025-04-14 01:18:39,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9355, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10235, PETRI_PLACES=262, PETRI_TRANSITIONS=881} [2025-04-14 01:18:39,218 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2025-04-14 01:18:39,218 INFO L485 AbstractCegarLoop]: Abstraction has has 262 places, 881 transitions, 10235 flow [2025-04-14 01:18:39,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:39,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:39,218 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] [2025-04-14 01:18:39,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:18:39,219 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:18:39,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1530210398, now seen corresponding path program 9 times [2025-04-14 01:18:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:39,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93832444] [2025-04-14 01:18:39,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:39,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:39,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:39,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:39,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:39,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93832444] [2025-04-14 01:18:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93832444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261248620] [2025-04-14 01:18:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:39,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:39,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:39,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:39,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:39,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 881 transitions, 10235 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:39,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:39,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:40,340 INFO L116 PetriNetUnfolderBase]: 3709/5623 cut-off events. [2025-04-14 01:18:40,340 INFO L117 PetriNetUnfolderBase]: For 18628/18628 co-relation queries the response was YES. [2025-04-14 01:18:40,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33389 conditions, 5623 events. 3709/5623 cut-off events. For 18628/18628 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 31541 event pairs, 292 based on Foata normal form. 2/5099 useless extension candidates. Maximal degree in co-relation 33203. Up to 5312 conditions per place. [2025-04-14 01:18:40,380 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 791 selfloop transitions, 130 changer transitions 4/925 dead transitions. [2025-04-14 01:18:40,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 925 transitions, 12467 flow [2025-04-14 01:18:40,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:18:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:18:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2025-04-14 01:18:40,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2025-04-14 01:18:40,381 INFO L175 Difference]: Start difference. First operand has 262 places, 881 transitions, 10235 flow. Second operand 11 states and 115 transitions. [2025-04-14 01:18:40,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 925 transitions, 12467 flow [2025-04-14 01:18:40,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 925 transitions, 12401 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:40,633 INFO L231 Difference]: Finished difference. Result has 275 places, 900 transitions, 10819 flow [2025-04-14 01:18:40,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10169, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10819, PETRI_PLACES=275, PETRI_TRANSITIONS=900} [2025-04-14 01:18:40,634 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2025-04-14 01:18:40,634 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 900 transitions, 10819 flow [2025-04-14 01:18:40,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:40,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:40,634 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] [2025-04-14 01:18:40,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:18:40,634 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:18:40,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1277014000, now seen corresponding path program 10 times [2025-04-14 01:18:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:40,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-04-14 01:18:40,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:40,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:40,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:40,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:40,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:40,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-04-14 01:18:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657739477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989705] [2025-04-14 01:18:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:40,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:40,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:40,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:40,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:40,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 900 transitions, 10819 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:40,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:40,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:40,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:41,866 INFO L116 PetriNetUnfolderBase]: 3926/5930 cut-off events. [2025-04-14 01:18:41,866 INFO L117 PetriNetUnfolderBase]: For 21508/21508 co-relation queries the response was YES. [2025-04-14 01:18:41,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36050 conditions, 5930 events. 3926/5930 cut-off events. For 21508/21508 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 33322 event pairs, 256 based on Foata normal form. 2/5347 useless extension candidates. Maximal degree in co-relation 35854. Up to 5207 conditions per place. [2025-04-14 01:18:41,910 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 719 selfloop transitions, 257 changer transitions 5/981 dead transitions. [2025-04-14 01:18:41,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 981 transitions, 13593 flow [2025-04-14 01:18:41,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:18:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:18:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2025-04-14 01:18:41,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2025-04-14 01:18:41,911 INFO L175 Difference]: Start difference. First operand has 275 places, 900 transitions, 10819 flow. Second operand 11 states and 129 transitions. [2025-04-14 01:18:41,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 981 transitions, 13593 flow [2025-04-14 01:18:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 981 transitions, 13415 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-04-14 01:18:42,273 INFO L231 Difference]: Finished difference. Result has 285 places, 938 transitions, 11844 flow [2025-04-14 01:18:42,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10641, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11844, PETRI_PLACES=285, PETRI_TRANSITIONS=938} [2025-04-14 01:18:42,274 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2025-04-14 01:18:42,274 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 938 transitions, 11844 flow [2025-04-14 01:18:42,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:42,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:42,275 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] [2025-04-14 01:18:42,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:18:42,275 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:18:42,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash 209614426, now seen corresponding path program 11 times [2025-04-14 01:18:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:42,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701305635] [2025-04-14 01:18:42,276 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:42,281 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:42,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:42,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:42,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701305635] [2025-04-14 01:18:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701305635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:42,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754397241] [2025-04-14 01:18:42,648 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:42,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:42,650 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:18:42,652 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:18:42,690 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:42,706 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:42,706 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:42,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:42,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:18:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:42,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:42,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:18:42,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-14 01:18:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:43,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:43,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:18:43,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:18:43,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:18:43,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:18:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754397241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:18:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222546310] [2025-04-14 01:18:43,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:43,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:18:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:43,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:18:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:18:43,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:43,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 938 transitions, 11844 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:18:43,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:43,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:43,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:46,746 INFO L116 PetriNetUnfolderBase]: 5288/7986 cut-off events. [2025-04-14 01:18:46,746 INFO L117 PetriNetUnfolderBase]: For 31252/31252 co-relation queries the response was YES. [2025-04-14 01:18:46,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50718 conditions, 7986 events. 5288/7986 cut-off events. For 31252/31252 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 47405 event pairs, 133 based on Foata normal form. 2/7268 useless extension candidates. Maximal degree in co-relation 50488. Up to 3305 conditions per place. [2025-04-14 01:18:46,808 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 381 selfloop transitions, 1182 changer transitions 1/1564 dead transitions. [2025-04-14 01:18:46,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1564 transitions, 21414 flow [2025-04-14 01:18:46,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-14 01:18:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-14 01:18:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 583 transitions. [2025-04-14 01:18:46,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33125 [2025-04-14 01:18:46,810 INFO L175 Difference]: Start difference. First operand has 285 places, 938 transitions, 11844 flow. Second operand 55 states and 583 transitions. [2025-04-14 01:18:46,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1564 transitions, 21414 flow [2025-04-14 01:18:47,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1564 transitions, 21005 flow, removed 63 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:47,474 INFO L231 Difference]: Finished difference. Result has 349 places, 1396 transitions, 20329 flow [2025-04-14 01:18:47,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11478, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=752, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=20329, PETRI_PLACES=349, PETRI_TRANSITIONS=1396} [2025-04-14 01:18:47,475 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 318 predicate places. [2025-04-14 01:18:47,476 INFO L485 AbstractCegarLoop]: Abstraction has has 349 places, 1396 transitions, 20329 flow [2025-04-14 01:18:47,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:18:47,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:47,476 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] [2025-04-14 01:18:47,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:18:47,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:47,676 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:18:47,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2138752488, now seen corresponding path program 12 times [2025-04-14 01:18:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:47,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107797403] [2025-04-14 01:18:47,677 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:47,681 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:47,683 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:47,683 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:47,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107797403] [2025-04-14 01:18:47,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107797403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:47,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:47,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761264672] [2025-04-14 01:18:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:47,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:47,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:47,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:47,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:47,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1396 transitions, 20329 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:47,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:47,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:47,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:49,650 INFO L116 PetriNetUnfolderBase]: 5291/7997 cut-off events. [2025-04-14 01:18:49,651 INFO L117 PetriNetUnfolderBase]: For 40615/40615 co-relation queries the response was YES. [2025-04-14 01:18:49,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57933 conditions, 7997 events. 5291/7997 cut-off events. For 40615/40615 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 47497 event pairs, 383 based on Foata normal form. 1/7286 useless extension candidates. Maximal degree in co-relation 57689. Up to 7636 conditions per place. [2025-04-14 01:18:49,726 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1279 selfloop transitions, 167 changer transitions 5/1451 dead transitions. [2025-04-14 01:18:49,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1451 transitions, 23869 flow [2025-04-14 01:18:49,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:18:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:18:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2025-04-14 01:18:49,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30528846153846156 [2025-04-14 01:18:49,727 INFO L175 Difference]: Start difference. First operand has 349 places, 1396 transitions, 20329 flow. Second operand 13 states and 127 transitions. [2025-04-14 01:18:49,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1451 transitions, 23869 flow [2025-04-14 01:18:50,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1451 transitions, 22709 flow, removed 326 selfloop flow, removed 19 redundant places. [2025-04-14 01:18:50,857 INFO L231 Difference]: Finished difference. Result has 347 places, 1422 transitions, 20167 flow [2025-04-14 01:18:50,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19222, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=20167, PETRI_PLACES=347, PETRI_TRANSITIONS=1422} [2025-04-14 01:18:50,859 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 316 predicate places. [2025-04-14 01:18:50,859 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 1422 transitions, 20167 flow [2025-04-14 01:18:50,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:50,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:50,859 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] [2025-04-14 01:18:50,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:18:50,859 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:18:50,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1631278670, now seen corresponding path program 13 times [2025-04-14 01:18:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:50,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706396763] [2025-04-14 01:18:50,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:50,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:50,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:50,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:51,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706396763] [2025-04-14 01:18:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706396763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:51,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212451484] [2025-04-14 01:18:51,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:51,251 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:18:51,252 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:18:51,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:51,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:51,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:51,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:18:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:51,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:51,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:18:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:51,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:51,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:18:51,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:18:51,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:18:51,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:18:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212451484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:51,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-14 01:18:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113913983] [2025-04-14 01:18:51,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:51,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:18:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:51,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:18:51,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:18:51,949 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:51,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1422 transitions, 20167 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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:18:51,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:51,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:51,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:54,337 INFO L116 PetriNetUnfolderBase]: 5819/8850 cut-off events. [2025-04-14 01:18:54,337 INFO L117 PetriNetUnfolderBase]: For 39453/39453 co-relation queries the response was YES. [2025-04-14 01:18:54,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61494 conditions, 8850 events. 5819/8850 cut-off events. For 39453/39453 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 54131 event pairs, 353 based on Foata normal form. 1/8009 useless extension candidates. Maximal degree in co-relation 61237. Up to 7158 conditions per place. [2025-04-14 01:18:54,409 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1192 selfloop transitions, 490 changer transitions 2/1684 dead transitions. [2025-04-14 01:18:54,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1684 transitions, 26531 flow [2025-04-14 01:18:54,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:18:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:18:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 202 transitions. [2025-04-14 01:18:54,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3005952380952381 [2025-04-14 01:18:54,410 INFO L175 Difference]: Start difference. First operand has 347 places, 1422 transitions, 20167 flow. Second operand 21 states and 202 transitions. [2025-04-14 01:18:54,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1684 transitions, 26531 flow [2025-04-14 01:18:55,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1684 transitions, 26054 flow, removed 99 selfloop flow, removed 7 redundant places. [2025-04-14 01:18:55,416 INFO L231 Difference]: Finished difference. Result has 371 places, 1568 transitions, 23436 flow [2025-04-14 01:18:55,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19701, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=23436, PETRI_PLACES=371, PETRI_TRANSITIONS=1568} [2025-04-14 01:18:55,418 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 340 predicate places. [2025-04-14 01:18:55,418 INFO L485 AbstractCegarLoop]: Abstraction has has 371 places, 1568 transitions, 23436 flow [2025-04-14 01:18:55,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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:18:55,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:55,418 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] [2025-04-14 01:18:55,424 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:18:55,618 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:18:55,619 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:18:55,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1636809952, now seen corresponding path program 14 times [2025-04-14 01:18:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:55,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-04-14 01:18:55,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:55,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:55,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:55,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:55,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:55,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-04-14 01:18:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690596570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426284650] [2025-04-14 01:18:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:55,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:55,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1568 transitions, 23436 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:57,800 INFO L116 PetriNetUnfolderBase]: 5898/8985 cut-off events. [2025-04-14 01:18:57,801 INFO L117 PetriNetUnfolderBase]: For 45152/45152 co-relation queries the response was YES. [2025-04-14 01:18:57,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65579 conditions, 8985 events. 5898/8985 cut-off events. For 45152/45152 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 55277 event pairs, 416 based on Foata normal form. 1/8114 useless extension candidates. Maximal degree in co-relation 65311. Up to 8628 conditions per place. [2025-04-14 01:18:57,885 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1463 selfloop transitions, 159 changer transitions 1/1623 dead transitions. [2025-04-14 01:18:57,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1623 transitions, 27165 flow [2025-04-14 01:18:57,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:18:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:18:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-14 01:18:57,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2025-04-14 01:18:57,886 INFO L175 Difference]: Start difference. First operand has 371 places, 1568 transitions, 23436 flow. Second operand 13 states and 126 transitions. [2025-04-14 01:18:57,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1623 transitions, 27165 flow [2025-04-14 01:18:59,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1623 transitions, 26621 flow, removed 130 selfloop flow, removed 11 redundant places. [2025-04-14 01:18:59,224 INFO L231 Difference]: Finished difference. Result has 378 places, 1592 transitions, 23715 flow [2025-04-14 01:18:59,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22899, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23715, PETRI_PLACES=378, PETRI_TRANSITIONS=1592} [2025-04-14 01:18:59,226 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 347 predicate places. [2025-04-14 01:18:59,226 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 1592 transitions, 23715 flow [2025-04-14 01:18:59,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:59,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:59,226 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] [2025-04-14 01:18:59,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:18:59,226 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:59,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1369646006, now seen corresponding path program 15 times [2025-04-14 01:18:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:59,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668925237] [2025-04-14 01:18:59,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:59,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:59,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:59,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:59,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:59,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668925237] [2025-04-14 01:18:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668925237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692110742] [2025-04-14 01:18:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:59,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:59,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:59,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:59,491 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:59,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1592 transitions, 23715 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:18:59,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:59,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:59,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:01,885 INFO L116 PetriNetUnfolderBase]: 5981/9111 cut-off events. [2025-04-14 01:19:01,885 INFO L117 PetriNetUnfolderBase]: For 47157/47157 co-relation queries the response was YES. [2025-04-14 01:19:01,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67228 conditions, 9111 events. 5981/9111 cut-off events. For 47157/47157 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 56103 event pairs, 425 based on Foata normal form. 1/8224 useless extension candidates. Maximal degree in co-relation 66947. Up to 8778 conditions per place. [2025-04-14 01:19:01,973 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1476 selfloop transitions, 185 changer transitions 4/1665 dead transitions. [2025-04-14 01:19:01,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1665 transitions, 27941 flow [2025-04-14 01:19:01,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:19:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:19:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 143 transitions. [2025-04-14 01:19:01,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29791666666666666 [2025-04-14 01:19:01,974 INFO L175 Difference]: Start difference. First operand has 378 places, 1592 transitions, 23715 flow. Second operand 15 states and 143 transitions. [2025-04-14 01:19:01,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1665 transitions, 27941 flow [2025-04-14 01:19:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1665 transitions, 27460 flow, removed 70 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:03,111 INFO L231 Difference]: Finished difference. Result has 391 places, 1635 transitions, 24521 flow [2025-04-14 01:19:03,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23308, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=24521, PETRI_PLACES=391, PETRI_TRANSITIONS=1635} [2025-04-14 01:19:03,112 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 360 predicate places. [2025-04-14 01:19:03,112 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 1635 transitions, 24521 flow [2025-04-14 01:19:03,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:19:03,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:03,113 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] [2025-04-14 01:19:03,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:19:03,113 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:03,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash 954119838, now seen corresponding path program 16 times [2025-04-14 01:19:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:03,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-04-14 01:19:03,113 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:03,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:03,122 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:03,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:03,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:03,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-04-14 01:19:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817258622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:19:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909365146] [2025-04-14 01:19:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:03,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:19:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:03,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:19:03,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:19:03,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:03,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 1635 transitions, 24521 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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:19:03,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:03,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:03,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:05,263 INFO L116 PetriNetUnfolderBase]: 5987/9136 cut-off events. [2025-04-14 01:19:05,263 INFO L117 PetriNetUnfolderBase]: For 47809/47809 co-relation queries the response was YES. [2025-04-14 01:19:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67731 conditions, 9136 events. 5987/9136 cut-off events. For 47809/47809 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 56393 event pairs, 458 based on Foata normal form. 1/8257 useless extension candidates. Maximal degree in co-relation 67439. Up to 8797 conditions per place. [2025-04-14 01:19:05,368 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1505 selfloop transitions, 151 changer transitions 5/1661 dead transitions. [2025-04-14 01:19:05,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1661 transitions, 28026 flow [2025-04-14 01:19:05,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 105 transitions. [2025-04-14 01:19:05,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2734375 [2025-04-14 01:19:05,369 INFO L175 Difference]: Start difference. First operand has 391 places, 1635 transitions, 24521 flow. Second operand 12 states and 105 transitions. [2025-04-14 01:19:05,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 1661 transitions, 28026 flow [2025-04-14 01:19:06,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1661 transitions, 27702 flow, removed 105 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:06,639 INFO L231 Difference]: Finished difference. Result has 400 places, 1642 transitions, 24646 flow [2025-04-14 01:19:06,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24197, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=24646, PETRI_PLACES=400, PETRI_TRANSITIONS=1642} [2025-04-14 01:19:06,641 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 369 predicate places. [2025-04-14 01:19:06,641 INFO L485 AbstractCegarLoop]: Abstraction has has 400 places, 1642 transitions, 24646 flow [2025-04-14 01:19:06,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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:19:06,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:06,641 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] [2025-04-14 01:19:06,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:19:06,642 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:06,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -475382882, now seen corresponding path program 17 times [2025-04-14 01:19:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:06,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019580416] [2025-04-14 01:19:06,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:06,648 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:06,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:06,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:06,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:06,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019580416] [2025-04-14 01:19:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019580416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:06,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479997064] [2025-04-14 01:19:06,923 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:06,925 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:19:06,925 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:19:06,961 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:06,973 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:06,973 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:06,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:19:06,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:06,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:19:07,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:19:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:07,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:07,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:19:07,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:19:07,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:19:07,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:19:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479997064] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:07,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:07,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:19:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360412602] [2025-04-14 01:19:07,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:07,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:19:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:07,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:19:07,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:19:07,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:07,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1642 transitions, 24646 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:19:07,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:07,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:07,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:10,899 INFO L116 PetriNetUnfolderBase]: 7157/10960 cut-off events. [2025-04-14 01:19:10,899 INFO L117 PetriNetUnfolderBase]: For 64012/64012 co-relation queries the response was YES. [2025-04-14 01:19:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80982 conditions, 10960 events. 7157/10960 cut-off events. For 64012/64012 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 70536 event pairs, 261 based on Foata normal form. 17/9857 useless extension candidates. Maximal degree in co-relation 80855. Up to 5595 conditions per place. [2025-04-14 01:19:11,007 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 798 selfloop transitions, 1135 changer transitions 1/1934 dead transitions. [2025-04-14 01:19:11,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1934 transitions, 31937 flow [2025-04-14 01:19:11,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:19:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:19:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 306 transitions. [2025-04-14 01:19:11,008 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34151785714285715 [2025-04-14 01:19:11,008 INFO L175 Difference]: Start difference. First operand has 400 places, 1642 transitions, 24646 flow. Second operand 28 states and 306 transitions. [2025-04-14 01:19:11,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1934 transitions, 31937 flow [2025-04-14 01:19:12,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1934 transitions, 31318 flow, removed 84 selfloop flow, removed 20 redundant places. [2025-04-14 01:19:12,583 INFO L231 Difference]: Finished difference. Result has 404 places, 1799 transitions, 31002 flow [2025-04-14 01:19:12,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20618, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=787, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=31002, PETRI_PLACES=404, PETRI_TRANSITIONS=1799} [2025-04-14 01:19:12,584 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 373 predicate places. [2025-04-14 01:19:12,584 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 1799 transitions, 31002 flow [2025-04-14 01:19:12,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:19:12,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:12,584 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] [2025-04-14 01:19:12,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:19:12,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:12,786 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:12,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -931705222, now seen corresponding path program 18 times [2025-04-14 01:19:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:12,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-04-14 01:19:12,787 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:12,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:12,796 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:12,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:19:12,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:12,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-04-14 01:19:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852433967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:12,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:19:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979832109] [2025-04-14 01:19:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:12,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:19:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:12,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:19:12,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:12,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:12,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1799 transitions, 31002 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:19:12,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:12,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:12,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:16,084 INFO L116 PetriNetUnfolderBase]: 7238/11114 cut-off events. [2025-04-14 01:19:16,084 INFO L117 PetriNetUnfolderBase]: For 88099/88099 co-relation queries the response was YES. [2025-04-14 01:19:16,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92312 conditions, 11114 events. 7238/11114 cut-off events. For 88099/88099 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 71671 event pairs, 556 based on Foata normal form. 1/9987 useless extension candidates. Maximal degree in co-relation 92182. Up to 10474 conditions per place. [2025-04-14 01:19:16,189 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1639 selfloop transitions, 216 changer transitions 1/1856 dead transitions. [2025-04-14 01:19:16,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1856 transitions, 35447 flow [2025-04-14 01:19:16,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:19:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:19:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2025-04-14 01:19:16,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29910714285714285 [2025-04-14 01:19:16,190 INFO L175 Difference]: Start difference. First operand has 404 places, 1799 transitions, 31002 flow. Second operand 14 states and 134 transitions. [2025-04-14 01:19:16,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1856 transitions, 35447 flow [2025-04-14 01:19:18,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1856 transitions, 34934 flow, removed 238 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:18,862 INFO L231 Difference]: Finished difference. Result has 415 places, 1828 transitions, 31736 flow [2025-04-14 01:19:18,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30599, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=31736, PETRI_PLACES=415, PETRI_TRANSITIONS=1828} [2025-04-14 01:19:18,863 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 384 predicate places. [2025-04-14 01:19:18,863 INFO L485 AbstractCegarLoop]: Abstraction has has 415 places, 1828 transitions, 31736 flow [2025-04-14 01:19:18,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:19:18,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:18,864 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] [2025-04-14 01:19:18,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:19:18,864 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:18,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1575150008, now seen corresponding path program 19 times [2025-04-14 01:19:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:18,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485307742] [2025-04-14 01:19:18,865 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:18,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:19,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485307742] [2025-04-14 01:19:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485307742] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:19,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726718616] [2025-04-14 01:19:19,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:19,154 INFO L229 MonitoredProcess]: Starting monitored process 8 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:19:19,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:19:19,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:19,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:19:19,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:19,227 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:19:19,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-14 01:19:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:19,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:19,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:19:19,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:19:19,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:19:19,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:19:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726718616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:19,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:19:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637625362] [2025-04-14 01:19:19,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:19,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:19:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:19,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:19:19,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:19:19,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:19,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1828 transitions, 31736 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:19:19,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:19,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:19,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:24,695 INFO L116 PetriNetUnfolderBase]: 8199/12679 cut-off events. [2025-04-14 01:19:24,695 INFO L117 PetriNetUnfolderBase]: For 101621/101621 co-relation queries the response was YES. [2025-04-14 01:19:24,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104399 conditions, 12679 events. 8199/12679 cut-off events. For 101621/101621 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 85030 event pairs, 200 based on Foata normal form. 2/11435 useless extension candidates. Maximal degree in co-relation 104267. Up to 5156 conditions per place. [2025-04-14 01:19:24,813 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 752 selfloop transitions, 1507 changer transitions 2/2261 dead transitions. [2025-04-14 01:19:24,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 2261 transitions, 42315 flow [2025-04-14 01:19:24,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:19:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:19:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 390 transitions. [2025-04-14 01:19:24,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-14 01:19:24,816 INFO L175 Difference]: Start difference. First operand has 415 places, 1828 transitions, 31736 flow. Second operand 39 states and 390 transitions. [2025-04-14 01:19:24,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 2261 transitions, 42315 flow [2025-04-14 01:19:27,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 2261 transitions, 41820 flow, removed 179 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:27,767 INFO L231 Difference]: Finished difference. Result has 462 places, 2131 transitions, 41100 flow [2025-04-14 01:19:27,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=31380, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=41100, PETRI_PLACES=462, PETRI_TRANSITIONS=2131} [2025-04-14 01:19:27,769 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 431 predicate places. [2025-04-14 01:19:27,769 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 2131 transitions, 41100 flow [2025-04-14 01:19:27,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 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:19:27,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:27,769 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] [2025-04-14 01:19:27,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 01:19:27,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:27,970 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:27,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -504387158, now seen corresponding path program 20 times [2025-04-14 01:19:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:27,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667484888] [2025-04-14 01:19:27,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:27,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:27,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:27,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:27,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:28,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667484888] [2025-04-14 01:19:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667484888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:19:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035835029] [2025-04-14 01:19:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:28,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:19:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:28,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:19:28,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:28,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:28,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 2131 transitions, 41100 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:19:28,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:28,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:28,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:32,576 INFO L116 PetriNetUnfolderBase]: 8239/12753 cut-off events. [2025-04-14 01:19:32,576 INFO L117 PetriNetUnfolderBase]: For 130860/130860 co-relation queries the response was YES. [2025-04-14 01:19:32,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117733 conditions, 12753 events. 8239/12753 cut-off events. For 130860/130860 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 85453 event pairs, 632 based on Foata normal form. 2/11489 useless extension candidates. Maximal degree in co-relation 117585. Up to 12438 conditions per place. [2025-04-14 01:19:32,730 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 2033 selfloop transitions, 133 changer transitions 5/2171 dead transitions. [2025-04-14 01:19:32,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 2171 transitions, 45843 flow [2025-04-14 01:19:32,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2025-04-14 01:19:32,731 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.296875 [2025-04-14 01:19:32,731 INFO L175 Difference]: Start difference. First operand has 462 places, 2131 transitions, 41100 flow. Second operand 12 states and 114 transitions. [2025-04-14 01:19:32,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 2171 transitions, 45843 flow [2025-04-14 01:19:36,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 2171 transitions, 45168 flow, removed 277 selfloop flow, removed 10 redundant places. [2025-04-14 01:19:36,730 INFO L231 Difference]: Finished difference. Result has 465 places, 2144 transitions, 40974 flow [2025-04-14 01:19:36,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40437, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=40974, PETRI_PLACES=465, PETRI_TRANSITIONS=2144} [2025-04-14 01:19:36,731 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 434 predicate places. [2025-04-14 01:19:36,731 INFO L485 AbstractCegarLoop]: Abstraction has has 465 places, 2144 transitions, 40974 flow [2025-04-14 01:19:36,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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:19:36,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:36,732 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] [2025-04-14 01:19:36,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:19:36,732 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:36,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1385105070, now seen corresponding path program 21 times [2025-04-14 01:19:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:36,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-04-14 01:19:36,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:36,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:36,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:36,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:36,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:36,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-04-14 01:19:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875762269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631724082] [2025-04-14 01:19:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:36,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:36,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:36,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:36,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:36,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 2144 transitions, 40974 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:36,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:36,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:36,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:41,496 INFO L116 PetriNetUnfolderBase]: 8363/12992 cut-off events. [2025-04-14 01:19:41,496 INFO L117 PetriNetUnfolderBase]: For 123523/123523 co-relation queries the response was YES. [2025-04-14 01:19:41,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117924 conditions, 12992 events. 8363/12992 cut-off events. For 123523/123523 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 87287 event pairs, 623 based on Foata normal form. 2/11722 useless extension candidates. Maximal degree in co-relation 117775. Up to 12163 conditions per place. [2025-04-14 01:19:41,643 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 1849 selfloop transitions, 386 changer transitions 1/2236 dead transitions. [2025-04-14 01:19:41,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 2236 transitions, 46824 flow [2025-04-14 01:19:41,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2025-04-14 01:19:41,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-14 01:19:41,644 INFO L175 Difference]: Start difference. First operand has 465 places, 2144 transitions, 40974 flow. Second operand 12 states and 130 transitions. [2025-04-14 01:19:41,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 2236 transitions, 46824 flow [2025-04-14 01:19:45,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 2236 transitions, 46525 flow, removed 33 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:45,469 INFO L231 Difference]: Finished difference. Result has 471 places, 2204 transitions, 42825 flow [2025-04-14 01:19:45,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40675, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=42825, PETRI_PLACES=471, PETRI_TRANSITIONS=2204} [2025-04-14 01:19:45,471 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 440 predicate places. [2025-04-14 01:19:45,471 INFO L485 AbstractCegarLoop]: Abstraction has has 471 places, 2204 transitions, 42825 flow [2025-04-14 01:19:45,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:45,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:45,472 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] [2025-04-14 01:19:45,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 01:19:45,472 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:45,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1329693810, now seen corresponding path program 22 times [2025-04-14 01:19:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:45,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475863236] [2025-04-14 01:19:45,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:45,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:45,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:45,480 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:45,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:45,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475863236] [2025-04-14 01:19:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475863236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171938097] [2025-04-14 01:19:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:45,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:45,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:45,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:45,694 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:45,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 2204 transitions, 42825 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:50,139 INFO L116 PetriNetUnfolderBase]: 8669/13516 cut-off events. [2025-04-14 01:19:50,139 INFO L117 PetriNetUnfolderBase]: For 136889/136889 co-relation queries the response was YES. [2025-04-14 01:19:50,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124116 conditions, 13516 events. 8669/13516 cut-off events. For 136889/136889 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 91863 event pairs, 549 based on Foata normal form. 2/12194 useless extension candidates. Maximal degree in co-relation 123967. Up to 11161 conditions per place. [2025-04-14 01:19:50,282 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1700 selfloop transitions, 716 changer transitions 5/2421 dead transitions. [2025-04-14 01:19:50,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 2421 transitions, 51373 flow [2025-04-14 01:19:50,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2025-04-14 01:19:50,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:19:50,283 INFO L175 Difference]: Start difference. First operand has 471 places, 2204 transitions, 42825 flow. Second operand 12 states and 144 transitions. [2025-04-14 01:19:50,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 2421 transitions, 51373 flow [2025-04-14 01:19:54,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 2421 transitions, 50990 flow, removed 115 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:54,303 INFO L231 Difference]: Finished difference. Result has 482 places, 2319 transitions, 47386 flow [2025-04-14 01:19:54,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42520, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=607, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=47386, PETRI_PLACES=482, PETRI_TRANSITIONS=2319} [2025-04-14 01:19:54,305 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 451 predicate places. [2025-04-14 01:19:54,305 INFO L485 AbstractCegarLoop]: Abstraction has has 482 places, 2319 transitions, 47386 flow [2025-04-14 01:19:54,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:54,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:54,306 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] [2025-04-14 01:19:54,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:19:54,306 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:54,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -94373516, now seen corresponding path program 23 times [2025-04-14 01:19:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:54,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398934078] [2025-04-14 01:19:54,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:54,311 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:54,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:54,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:54,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398934078] [2025-04-14 01:19:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398934078] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:54,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528191640] [2025-04-14 01:19:54,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:54,638 INFO L229 MonitoredProcess]: Starting monitored process 9 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:19:54,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:19:54,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:54,688 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:54,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:54,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:54,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:19:54,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:54,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:19:54,818 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:19:54,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-14 01:19:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:54,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:55,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-14 01:19:55,263 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-14 01:19:55,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-14 01:19:55,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-14 01:19:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528191640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:55,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-14 01:19:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511939302] [2025-04-14 01:19:55,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:55,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:19:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:55,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:19:55,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:19:55,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:55,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 2319 transitions, 47386 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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:19:55,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:55,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:55,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:02,628 INFO L116 PetriNetUnfolderBase]: 9935/15385 cut-off events. [2025-04-14 01:20:02,628 INFO L117 PetriNetUnfolderBase]: For 183973/183973 co-relation queries the response was YES. [2025-04-14 01:20:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147099 conditions, 15385 events. 9935/15385 cut-off events. For 183973/183973 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 105444 event pairs, 407 based on Foata normal form. 4/13926 useless extension candidates. Maximal degree in co-relation 146945. Up to 9131 conditions per place. [2025-04-14 01:20:02,878 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1215 selfloop transitions, 1581 changer transitions 1/2797 dead transitions. [2025-04-14 01:20:02,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 2797 transitions, 60859 flow [2025-04-14 01:20:02,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:20:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:20:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 467 transitions. [2025-04-14 01:20:02,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33167613636363635 [2025-04-14 01:20:02,880 INFO L175 Difference]: Start difference. First operand has 482 places, 2319 transitions, 47386 flow. Second operand 44 states and 467 transitions. [2025-04-14 01:20:02,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 2797 transitions, 60859 flow [2025-04-14 01:20:08,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 2797 transitions, 60632 flow, removed 58 selfloop flow, removed 3 redundant places. [2025-04-14 01:20:08,679 INFO L231 Difference]: Finished difference. Result has 534 places, 2651 transitions, 58330 flow [2025-04-14 01:20:08,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=47177, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=58330, PETRI_PLACES=534, PETRI_TRANSITIONS=2651} [2025-04-14 01:20:08,681 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 503 predicate places. [2025-04-14 01:20:08,681 INFO L485 AbstractCegarLoop]: Abstraction has has 534 places, 2651 transitions, 58330 flow [2025-04-14 01:20:08,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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:20:08,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:08,681 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:08,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:20:08,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:20:08,882 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:08,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1069073406, now seen corresponding path program 24 times [2025-04-14 01:20:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:08,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417160481] [2025-04-14 01:20:08,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:08,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:20:08,891 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 01:20:08,891 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:08,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:09,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417160481] [2025-04-14 01:20:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417160481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:09,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885794549] [2025-04-14 01:20:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:09,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:09,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:09,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:09,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:09,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 2651 transitions, 58330 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:09,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:09,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:09,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:15,671 INFO L116 PetriNetUnfolderBase]: 10098/15682 cut-off events. [2025-04-14 01:20:15,672 INFO L117 PetriNetUnfolderBase]: For 214153/214153 co-relation queries the response was YES. [2025-04-14 01:20:15,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161208 conditions, 15682 events. 10098/15682 cut-off events. For 214153/214153 co-relation queries the response was YES. Maximal size of possible extension queue 1467. Compared 109615 event pairs, 495 based on Foata normal form. 2/14215 useless extension candidates. Maximal degree in co-relation 161041. Up to 14335 conditions per place. [2025-04-14 01:20:15,930 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 2379 selfloop transitions, 462 changer transitions 10/2851 dead transitions. [2025-04-14 01:20:15,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 2851 transitions, 67789 flow [2025-04-14 01:20:15,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-04-14 01:20:15,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.390625 [2025-04-14 01:20:15,931 INFO L175 Difference]: Start difference. First operand has 534 places, 2651 transitions, 58330 flow. Second operand 10 states and 125 transitions. [2025-04-14 01:20:15,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 2851 transitions, 67789 flow [2025-04-14 01:20:23,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 2851 transitions, 66256 flow, removed 337 selfloop flow, removed 19 redundant places. [2025-04-14 01:20:23,358 INFO L231 Difference]: Finished difference. Result has 528 places, 2790 transitions, 61402 flow [2025-04-14 01:20:23,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56862, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=61402, PETRI_PLACES=528, PETRI_TRANSITIONS=2790} [2025-04-14 01:20:23,360 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 497 predicate places. [2025-04-14 01:20:23,360 INFO L485 AbstractCegarLoop]: Abstraction has has 528 places, 2790 transitions, 61402 flow [2025-04-14 01:20:23,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:23,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:23,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:23,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 01:20:23,361 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:23,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1216226510, now seen corresponding path program 25 times [2025-04-14 01:20:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:23,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-04-14 01:20:23,361 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:20:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:20:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:23,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-04-14 01:20:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487544509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:23,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893313875] [2025-04-14 01:20:23,404 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:23,406 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:20:23,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:20:23,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:20:23,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:23,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:23,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:20:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:23,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893313875] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-14 01:20:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623916833] [2025-04-14 01:20:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:23,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:23,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:23,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:23,537 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:23,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 2790 transitions, 61402 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:20:23,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:23,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:23,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:30,563 INFO L116 PetriNetUnfolderBase]: 11015/16580 cut-off events. [2025-04-14 01:20:30,563 INFO L117 PetriNetUnfolderBase]: For 229823/229823 co-relation queries the response was YES. [2025-04-14 01:20:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170582 conditions, 16580 events. 11015/16580 cut-off events. For 229823/229823 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 109166 event pairs, 2700 based on Foata normal form. 278/15459 useless extension candidates. Maximal degree in co-relation 170416. Up to 9938 conditions per place. [2025-04-14 01:20:30,824 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2945 selfloop transitions, 125 changer transitions 0/3070 dead transitions. [2025-04-14 01:20:30,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 3070 transitions, 72027 flow [2025-04-14 01:20:30,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-14 01:20:30,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-14 01:20:30,826 INFO L175 Difference]: Start difference. First operand has 528 places, 2790 transitions, 61402 flow. Second operand 6 states and 87 transitions. [2025-04-14 01:20:30,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 3070 transitions, 72027 flow [2025-04-14 01:20:38,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 3070 transitions, 71238 flow, removed 209 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:38,595 INFO L231 Difference]: Finished difference. Result has 529 places, 2610 transitions, 56905 flow [2025-04-14 01:20:38,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55985, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=56905, PETRI_PLACES=529, PETRI_TRANSITIONS=2610} [2025-04-14 01:20:38,598 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 498 predicate places. [2025-04-14 01:20:38,598 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 2610 transitions, 56905 flow [2025-04-14 01:20:38,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:20:38,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:38,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:38,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:20:38,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 01:20:38,799 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:38,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash 164126249, now seen corresponding path program 1 times [2025-04-14 01:20:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:38,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662835381] [2025-04-14 01:20:38,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:38,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:38,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662835381] [2025-04-14 01:20:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662835381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:38,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225474167] [2025-04-14 01:20:38,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:38,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:38,843 INFO L229 MonitoredProcess]: Starting monitored process 11 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:20:38,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:20:38,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:38,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:38,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:38,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:38,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:38,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:38,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225474167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:38,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:38,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376303194] [2025-04-14 01:20:38,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:38,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:38,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:38,965 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:38,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 2610 transitions, 56905 flow. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:38,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:38,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:38,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:43,897 INFO L116 PetriNetUnfolderBase]: 7895/12233 cut-off events. [2025-04-14 01:20:43,897 INFO L117 PetriNetUnfolderBase]: For 181979/181979 co-relation queries the response was YES. [2025-04-14 01:20:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124118 conditions, 12233 events. 7895/12233 cut-off events. For 181979/181979 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 81375 event pairs, 2018 based on Foata normal form. 218/11530 useless extension candidates. Maximal degree in co-relation 123951. Up to 6642 conditions per place. [2025-04-14 01:20:44,048 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2181 selfloop transitions, 128 changer transitions 57/2366 dead transitions. [2025-04-14 01:20:44,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 2366 transitions, 55833 flow [2025-04-14 01:20:44,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-14 01:20:44,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 01:20:44,049 INFO L175 Difference]: Start difference. First operand has 529 places, 2610 transitions, 56905 flow. Second operand 6 states and 84 transitions. [2025-04-14 01:20:44,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 2366 transitions, 55833 flow [2025-04-14 01:20:48,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 2366 transitions, 55766 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:48,290 INFO L231 Difference]: Finished difference. Result has 516 places, 2141 transitions, 47153 flow [2025-04-14 01:20:48,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=47631, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=47153, PETRI_PLACES=516, PETRI_TRANSITIONS=2141} [2025-04-14 01:20:48,292 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 485 predicate places. [2025-04-14 01:20:48,292 INFO L485 AbstractCegarLoop]: Abstraction has has 516 places, 2141 transitions, 47153 flow [2025-04-14 01:20:48,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:48,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:48,292 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] [2025-04-14 01:20:48,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:20:48,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 01:20:48,493 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:48,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash 240535345, now seen corresponding path program 1 times [2025-04-14 01:20:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:48,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745504724] [2025-04-14 01:20:48,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:48,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:48,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:48,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:48,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745504724] [2025-04-14 01:20:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745504724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:48,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429279676] [2025-04-14 01:20:48,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:48,539 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:48,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:20:48,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:48,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429279676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:48,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-14 01:20:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462710411] [2025-04-14 01:20:48,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:48,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:48,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:48,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:48,674 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:48,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 2141 transitions, 47153 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:20:48,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:48,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:48,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:51,744 INFO L116 PetriNetUnfolderBase]: 5812/8998 cut-off events. [2025-04-14 01:20:51,744 INFO L117 PetriNetUnfolderBase]: For 141897/141897 co-relation queries the response was YES. [2025-04-14 01:20:52,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91161 conditions, 8998 events. 5812/8998 cut-off events. For 141897/141897 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 56054 event pairs, 1403 based on Foata normal form. 224/8530 useless extension candidates. Maximal degree in co-relation 90996. Up to 5029 conditions per place. [2025-04-14 01:20:52,066 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1694 selfloop transitions, 34 changer transitions 22/1750 dead transitions. [2025-04-14 01:20:52,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1750 transitions, 40481 flow [2025-04-14 01:20:52,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2025-04-14 01:20:52,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-04-14 01:20:52,073 INFO L175 Difference]: Start difference. First operand has 516 places, 2141 transitions, 47153 flow. Second operand 6 states and 81 transitions. [2025-04-14 01:20:52,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1750 transitions, 40481 flow [2025-04-14 01:20:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 1750 transitions, 38537 flow, removed 540 selfloop flow, removed 22 redundant places. [2025-04-14 01:20:54,578 INFO L231 Difference]: Finished difference. Result has 477 places, 1654 transitions, 33584 flow [2025-04-14 01:20:54,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33805, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33584, PETRI_PLACES=477, PETRI_TRANSITIONS=1654} [2025-04-14 01:20:54,579 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 446 predicate places. [2025-04-14 01:20:54,579 INFO L485 AbstractCegarLoop]: Abstraction has has 477 places, 1654 transitions, 33584 flow [2025-04-14 01:20:54,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:20:54,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:54,580 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:54,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:20:54,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:54,781 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:54,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2104132003, now seen corresponding path program 1 times [2025-04-14 01:20:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:54,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320362289] [2025-04-14 01:20:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:54,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:54,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:54,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:54,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:54,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320362289] [2025-04-14 01:20:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320362289] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:54,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946210309] [2025-04-14 01:20:54,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:54,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:54,823 INFO L229 MonitoredProcess]: Starting monitored process 13 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:20:54,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:20:54,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:54,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:54,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:54,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:54,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:20:54,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:54,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946210309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:54,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501402878] [2025-04-14 01:20:54,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:54,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:54,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:54,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:54,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 1654 transitions, 33584 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:20:54,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:54,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:57,030 INFO L116 PetriNetUnfolderBase]: 4919/7615 cut-off events. [2025-04-14 01:20:57,030 INFO L117 PetriNetUnfolderBase]: For 98357/98357 co-relation queries the response was YES. [2025-04-14 01:20:57,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75316 conditions, 7615 events. 4919/7615 cut-off events. For 98357/98357 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 45710 event pairs, 1343 based on Foata normal form. 306/7306 useless extension candidates. Maximal degree in co-relation 75167. Up to 6777 conditions per place. [2025-04-14 01:20:57,125 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1330 selfloop transitions, 3 changer transitions 167/1500 dead transitions. [2025-04-14 01:20:57,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1500 transitions, 33630 flow [2025-04-14 01:20:57,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-14 01:20:57,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-04-14 01:20:57,126 INFO L175 Difference]: Start difference. First operand has 477 places, 1654 transitions, 33584 flow. Second operand 6 states and 69 transitions. [2025-04-14 01:20:57,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1500 transitions, 33630 flow [2025-04-14 01:20:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 1500 transitions, 33140 flow, removed 144 selfloop flow, removed 16 redundant places. [2025-04-14 01:20:58,589 INFO L231 Difference]: Finished difference. Result has 460 places, 1333 transitions, 26818 flow [2025-04-14 01:20:58,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30114, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26818, PETRI_PLACES=460, PETRI_TRANSITIONS=1333} [2025-04-14 01:20:58,590 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 429 predicate places. [2025-04-14 01:20:58,590 INFO L485 AbstractCegarLoop]: Abstraction has has 460 places, 1333 transitions, 26818 flow [2025-04-14 01:20:58,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:20:58,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:58,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:58,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:20:58,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:58,790 INFO L403 AbstractCegarLoop]: === Iteration 32 === 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:20:58,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash -788958517, now seen corresponding path program 2 times [2025-04-14 01:20:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:58,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290061310] [2025-04-14 01:20:58,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:58,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:58,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:58,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:58,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:58,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290061310] [2025-04-14 01:20:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290061310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:58,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810690010] [2025-04-14 01:20:58,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:58,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:58,823 INFO L229 MonitoredProcess]: Starting monitored process 14 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:20:58,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:20:58,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:58,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:58,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:58,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:58,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:58,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810690010] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:20:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558589416] [2025-04-14 01:20:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:58,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:20:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:20:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:58,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:58,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 1333 transitions, 26818 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:20:58,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:58,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:00,439 INFO L116 PetriNetUnfolderBase]: 4533/6633 cut-off events. [2025-04-14 01:21:00,439 INFO L117 PetriNetUnfolderBase]: For 79959/79959 co-relation queries the response was YES. [2025-04-14 01:21:00,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66369 conditions, 6633 events. 4533/6633 cut-off events. For 79959/79959 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 35511 event pairs, 868 based on Foata normal form. 22/6078 useless extension candidates. Maximal degree in co-relation 66232. Up to 5028 conditions per place. [2025-04-14 01:21:00,521 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1270 selfloop transitions, 74 changer transitions 0/1344 dead transitions. [2025-04-14 01:21:00,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 1344 transitions, 29506 flow [2025-04-14 01:21:00,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-14 01:21:00,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-14 01:21:00,522 INFO L175 Difference]: Start difference. First operand has 460 places, 1333 transitions, 26818 flow. Second operand 7 states and 74 transitions. [2025-04-14 01:21:00,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 1344 transitions, 29506 flow [2025-04-14 01:21:01,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1344 transitions, 28435 flow, removed 193 selfloop flow, removed 44 redundant places. [2025-04-14 01:21:01,658 INFO L231 Difference]: Finished difference. Result has 374 places, 1287 transitions, 25166 flow [2025-04-14 01:21:01,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24880, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=25166, PETRI_PLACES=374, PETRI_TRANSITIONS=1287} [2025-04-14 01:21:01,659 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 343 predicate places. [2025-04-14 01:21:01,659 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 1287 transitions, 25166 flow [2025-04-14 01:21:01,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:21:01,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:01,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:01,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:21:01,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-14 01:21:01,860 INFO L403 AbstractCegarLoop]: === Iteration 33 === 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:21:01,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -567580863, now seen corresponding path program 3 times [2025-04-14 01:21:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:01,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32887590] [2025-04-14 01:21:01,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:01,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:01,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:01,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:01,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:01,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32887590] [2025-04-14 01:21:01,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32887590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:01,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377012620] [2025-04-14 01:21:01,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:01,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:01,896 INFO L229 MonitoredProcess]: Starting monitored process 15 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:21:01,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:21:01,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:01,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:01,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:01,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:01,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:01,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:21:01,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:21:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377012620] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:21:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215757301] [2025-04-14 01:21:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:02,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:02,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:02,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:21:02,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:02,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1287 transitions, 25166 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:21:02,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:02,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:02,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:03,536 INFO L116 PetriNetUnfolderBase]: 4596/6733 cut-off events. [2025-04-14 01:21:03,536 INFO L117 PetriNetUnfolderBase]: For 77769/77769 co-relation queries the response was YES. [2025-04-14 01:21:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65465 conditions, 6733 events. 4596/6733 cut-off events. For 77769/77769 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 36132 event pairs, 487 based on Foata normal form. 41/6182 useless extension candidates. Maximal degree in co-relation 65349. Up to 4924 conditions per place. [2025-04-14 01:21:03,599 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1177 selfloop transitions, 199 changer transitions 0/1376 dead transitions. [2025-04-14 01:21:03,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1376 transitions, 29463 flow [2025-04-14 01:21:03,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-14 01:21:03,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-14 01:21:03,600 INFO L175 Difference]: Start difference. First operand has 374 places, 1287 transitions, 25166 flow. Second operand 7 states and 78 transitions. [2025-04-14 01:21:03,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1376 transitions, 29463 flow [2025-04-14 01:21:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1376 transitions, 29412 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:04,506 INFO L231 Difference]: Finished difference. Result has 377 places, 1308 transitions, 26491 flow [2025-04-14 01:21:04,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=25040, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=26491, PETRI_PLACES=377, PETRI_TRANSITIONS=1308} [2025-04-14 01:21:04,507 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 346 predicate places. [2025-04-14 01:21:04,507 INFO L485 AbstractCegarLoop]: Abstraction has has 377 places, 1308 transitions, 26491 flow [2025-04-14 01:21:04,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:21:04,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:04,507 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:04,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:21:04,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:04,708 INFO L403 AbstractCegarLoop]: === Iteration 34 === 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:21:04,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1399613321, now seen corresponding path program 4 times [2025-04-14 01:21:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:04,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829020645] [2025-04-14 01:21:04,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:04,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:04,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:21:04,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:21:04,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:04,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:04,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829020645] [2025-04-14 01:21:04,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829020645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:04,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284823166] [2025-04-14 01:21:04,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:04,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:04,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:04,738 INFO L229 MonitoredProcess]: Starting monitored process 16 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:21:04,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:21:04,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:04,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:21:04,787 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:21:04,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:04,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:04,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:04,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284823166] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:04,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-14 01:21:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033421506] [2025-04-14 01:21:04,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:04,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:21:04,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:04,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:21:04,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:21:04,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:04,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1308 transitions, 26491 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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:21:04,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:04,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:04,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:06,785 INFO L116 PetriNetUnfolderBase]: 5717/8304 cut-off events. [2025-04-14 01:21:06,786 INFO L117 PetriNetUnfolderBase]: For 98967/98967 co-relation queries the response was YES. [2025-04-14 01:21:06,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80849 conditions, 8304 events. 5717/8304 cut-off events. For 98967/98967 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 45536 event pairs, 131 based on Foata normal form. 12/7617 useless extension candidates. Maximal degree in co-relation 80731. Up to 3734 conditions per place. [2025-04-14 01:21:06,895 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1590 selfloop transitions, 441 changer transitions 0/2031 dead transitions. [2025-04-14 01:21:06,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 2031 transitions, 43997 flow [2025-04-14 01:21:06,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:21:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:21:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2025-04-14 01:21:06,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4735576923076923 [2025-04-14 01:21:06,896 INFO L175 Difference]: Start difference. First operand has 377 places, 1308 transitions, 26491 flow. Second operand 13 states and 197 transitions. [2025-04-14 01:21:06,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 2031 transitions, 43997 flow [2025-04-14 01:21:08,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 2031 transitions, 43934 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:08,460 INFO L231 Difference]: Finished difference. Result has 393 places, 1495 transitions, 31806 flow [2025-04-14 01:21:08,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=26464, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=31806, PETRI_PLACES=393, PETRI_TRANSITIONS=1495} [2025-04-14 01:21:08,462 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 362 predicate places. [2025-04-14 01:21:08,462 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 1495 transitions, 31806 flow [2025-04-14 01:21:08,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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:21:08,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:08,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:08,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 01:21:08,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:08,663 INFO L403 AbstractCegarLoop]: === Iteration 35 === 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:21:08,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2060969959, now seen corresponding path program 5 times [2025-04-14 01:21:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:08,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384682439] [2025-04-14 01:21:08,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:08,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:08,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:08,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:08,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:08,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384682439] [2025-04-14 01:21:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384682439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:08,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990300349] [2025-04-14 01:21:08,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:08,696 INFO L229 MonitoredProcess]: Starting monitored process 17 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:21:08,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:21:08,736 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:08,749 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:08,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:08,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:08,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:08,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:08,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990300349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:08,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 01:21:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477748236] [2025-04-14 01:21:08,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:08,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:21:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:08,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:21:08,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:21:08,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:08,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1495 transitions, 31806 flow. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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:21:08,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:08,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:08,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:11,789 INFO L116 PetriNetUnfolderBase]: 8102/11732 cut-off events. [2025-04-14 01:21:11,789 INFO L117 PetriNetUnfolderBase]: For 188765/188765 co-relation queries the response was YES. [2025-04-14 01:21:11,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114848 conditions, 11732 events. 8102/11732 cut-off events. For 188765/188765 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 66965 event pairs, 401 based on Foata normal form. 22/11427 useless extension candidates. Maximal degree in co-relation 114723. Up to 5577 conditions per place. [2025-04-14 01:21:11,966 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1629 selfloop transitions, 646 changer transitions 0/2275 dead transitions. [2025-04-14 01:21:11,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 2275 transitions, 51549 flow [2025-04-14 01:21:11,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:21:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:21:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2025-04-14 01:21:11,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46205357142857145 [2025-04-14 01:21:11,967 INFO L175 Difference]: Start difference. First operand has 393 places, 1495 transitions, 31806 flow. Second operand 14 states and 207 transitions. [2025-04-14 01:21:11,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 2275 transitions, 51549 flow [2025-04-14 01:21:15,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 2275 transitions, 51176 flow, removed 111 selfloop flow, removed 1 redundant places. [2025-04-14 01:21:15,365 INFO L231 Difference]: Finished difference. Result has 415 places, 1718 transitions, 39041 flow [2025-04-14 01:21:15,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=31517, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=39041, PETRI_PLACES=415, PETRI_TRANSITIONS=1718} [2025-04-14 01:21:15,367 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 384 predicate places. [2025-04-14 01:21:15,367 INFO L485 AbstractCegarLoop]: Abstraction has has 415 places, 1718 transitions, 39041 flow [2025-04-14 01:21:15,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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:21:15,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:15,367 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 01:21:15,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-14 01:21:15,567 INFO L403 AbstractCegarLoop]: === Iteration 36 === 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:21:15,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2009455613, now seen corresponding path program 6 times [2025-04-14 01:21:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:15,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440334683] [2025-04-14 01:21:15,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:21:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:15,572 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:15,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:15,575 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:21:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:15,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440334683] [2025-04-14 01:21:15,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440334683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:15,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:15,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:21:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958966343] [2025-04-14 01:21:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:15,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:15,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:15,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1718 transitions, 39041 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:21:15,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:15,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:15,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:19,447 INFO L116 PetriNetUnfolderBase]: 8078/11692 cut-off events. [2025-04-14 01:21:19,448 INFO L117 PetriNetUnfolderBase]: For 223419/223419 co-relation queries the response was YES. [2025-04-14 01:21:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119635 conditions, 11692 events. 8078/11692 cut-off events. For 223419/223419 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 66781 event pairs, 1774 based on Foata normal form. 16/11399 useless extension candidates. Maximal degree in co-relation 119499. Up to 9321 conditions per place. [2025-04-14 01:21:19,809 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1553 selfloop transitions, 233 changer transitions 12/1798 dead transitions. [2025-04-14 01:21:19,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1798 transitions, 44082 flow [2025-04-14 01:21:19,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-14 01:21:19,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 01:21:19,811 INFO L175 Difference]: Start difference. First operand has 415 places, 1718 transitions, 39041 flow. Second operand 6 states and 80 transitions. [2025-04-14 01:21:19,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1798 transitions, 44082 flow [2025-04-14 01:21:22,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 1798 transitions, 43746 flow, removed 168 selfloop flow, removed 0 redundant places. [2025-04-14 01:21:22,826 INFO L231 Difference]: Finished difference. Result has 420 places, 1709 transitions, 39013 flow [2025-04-14 01:21:22,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38731, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=39013, PETRI_PLACES=420, PETRI_TRANSITIONS=1709} [2025-04-14 01:21:22,827 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 389 predicate places. [2025-04-14 01:21:22,827 INFO L485 AbstractCegarLoop]: Abstraction has has 420 places, 1709 transitions, 39013 flow [2025-04-14 01:21:22,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:21:22,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:22,828 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:22,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 01:21:22,828 INFO L403 AbstractCegarLoop]: === Iteration 37 === 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:21:22,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1579209951, now seen corresponding path program 7 times [2025-04-14 01:21:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:22,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912554555] [2025-04-14 01:21:22,829 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:22,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:22,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:22,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:22,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912554555] [2025-04-14 01:21:22,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912554555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:22,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763695185] [2025-04-14 01:21:22,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:22,875 INFO L229 MonitoredProcess]: Starting monitored process 18 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:21:22,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:21:22,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:22,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:22,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:22,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:23,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763695185] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:21:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640959207] [2025-04-14 01:21:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:23,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:23,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:21:23,060 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:23,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 1709 transitions, 39013 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:23,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:23,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:23,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:26,470 INFO L116 PetriNetUnfolderBase]: 8240/11862 cut-off events. [2025-04-14 01:21:26,470 INFO L117 PetriNetUnfolderBase]: For 215506/215506 co-relation queries the response was YES. [2025-04-14 01:21:26,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120317 conditions, 11862 events. 8240/11862 cut-off events. For 215506/215506 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 66694 event pairs, 976 based on Foata normal form. 78/11584 useless extension candidates. Maximal degree in co-relation 120180. Up to 7809 conditions per place. [2025-04-14 01:21:26,623 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1420 selfloop transitions, 423 changer transitions 0/1843 dead transitions. [2025-04-14 01:21:26,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1843 transitions, 45302 flow [2025-04-14 01:21:26,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-04-14 01:21:26,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-14 01:21:26,624 INFO L175 Difference]: Start difference. First operand has 420 places, 1709 transitions, 39013 flow. Second operand 7 states and 79 transitions. [2025-04-14 01:21:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1843 transitions, 45302 flow [2025-04-14 01:21:29,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1843 transitions, 44853 flow, removed 37 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:29,709 INFO L231 Difference]: Finished difference. Result has 417 places, 1683 transitions, 39517 flow [2025-04-14 01:21:29,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37912, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=39517, PETRI_PLACES=417, PETRI_TRANSITIONS=1683} [2025-04-14 01:21:29,711 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 386 predicate places. [2025-04-14 01:21:29,711 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 1683 transitions, 39517 flow [2025-04-14 01:21:29,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:29,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:29,711 INFO L206 CegarLoopForPetriNet]: trace histogram [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:21:29,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:21:29,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 01:21:29,912 INFO L403 AbstractCegarLoop]: === Iteration 38 === 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:21:29,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1521563712, now seen corresponding path program 1 times [2025-04-14 01:21:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:29,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799140711] [2025-04-14 01:21:29,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:29,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:29,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:29,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:29,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:21:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:30,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799140711] [2025-04-14 01:21:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799140711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:30,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501396612] [2025-04-14 01:21:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:30,495 INFO L229 MonitoredProcess]: Starting monitored process 19 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:21:30,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:21:30,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:30,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:30,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:30,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:30,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:21:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:31,011 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:31,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-14 01:21:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:31,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:31,702 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:31,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 159 [2025-04-14 01:21:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501396612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:32,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-14 01:21:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481796691] [2025-04-14 01:21:32,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:32,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:21:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:32,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:21:32,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:21:32,174 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:32,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1683 transitions, 39517 flow. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 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:21:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:39,267 INFO L116 PetriNetUnfolderBase]: 9718/14077 cut-off events. [2025-04-14 01:21:39,267 INFO L117 PetriNetUnfolderBase]: For 260869/260869 co-relation queries the response was YES. [2025-04-14 01:21:39,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141096 conditions, 14077 events. 9718/14077 cut-off events. For 260869/260869 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 82381 event pairs, 690 based on Foata normal form. 4/13658 useless extension candidates. Maximal degree in co-relation 140960. Up to 12038 conditions per place. [2025-04-14 01:21:39,440 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1621 selfloop transitions, 504 changer transitions 12/2137 dead transitions. [2025-04-14 01:21:39,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 2137 transitions, 51216 flow [2025-04-14 01:21:39,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 01:21:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 01:21:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 387 transitions. [2025-04-14 01:21:39,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3268581081081081 [2025-04-14 01:21:39,441 INFO L175 Difference]: Start difference. First operand has 417 places, 1683 transitions, 39517 flow. Second operand 37 states and 387 transitions. [2025-04-14 01:21:39,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 2137 transitions, 51216 flow [2025-04-14 01:21:43,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 2137 transitions, 51129 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-04-14 01:21:43,684 INFO L231 Difference]: Finished difference. Result has 464 places, 1940 transitions, 46317 flow [2025-04-14 01:21:43,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=39456, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=46317, PETRI_PLACES=464, PETRI_TRANSITIONS=1940} [2025-04-14 01:21:43,687 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 433 predicate places. [2025-04-14 01:21:43,687 INFO L485 AbstractCegarLoop]: Abstraction has has 464 places, 1940 transitions, 46317 flow [2025-04-14 01:21:43,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 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:21:43,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:43,687 INFO L206 CegarLoopForPetriNet]: trace histogram [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:21:43,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:21:43,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 01:21:43,888 INFO L403 AbstractCegarLoop]: === Iteration 39 === 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:21:43,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -11976610, now seen corresponding path program 2 times [2025-04-14 01:21:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:43,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379523965] [2025-04-14 01:21:43,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:43,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:43,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:43,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:43,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:44,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379523965] [2025-04-14 01:21:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379523965] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:44,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806547991] [2025-04-14 01:21:44,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:44,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:44,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:44,406 INFO L229 MonitoredProcess]: Starting monitored process 20 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:21:44,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:21:44,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:44,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:44,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:44,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:44,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:21:44,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:45,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:45,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:45,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:45,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 95 [2025-04-14 01:21:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:45,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:45,901 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:45,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:21:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:46,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806547991] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:46,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:21:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652071921] [2025-04-14 01:21:46,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:46,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:21:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:46,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:21:46,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:21:46,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1940 transitions, 46317 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 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:21:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:54,805 INFO L116 PetriNetUnfolderBase]: 11503/16679 cut-off events. [2025-04-14 01:21:54,805 INFO L117 PetriNetUnfolderBase]: For 339806/339806 co-relation queries the response was YES. [2025-04-14 01:21:54,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171969 conditions, 16679 events. 11503/16679 cut-off events. For 339806/339806 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 100588 event pairs, 596 based on Foata normal form. 2/16187 useless extension candidates. Maximal degree in co-relation 171819. Up to 12828 conditions per place. [2025-04-14 01:21:55,053 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1606 selfloop transitions, 848 changer transitions 9/2463 dead transitions. [2025-04-14 01:21:55,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 2463 transitions, 60307 flow [2025-04-14 01:21:55,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-14 01:21:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-14 01:21:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 445 transitions. [2025-04-14 01:21:55,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3234011627906977 [2025-04-14 01:21:55,054 INFO L175 Difference]: Start difference. First operand has 464 places, 1940 transitions, 46317 flow. Second operand 43 states and 445 transitions. [2025-04-14 01:21:55,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 2463 transitions, 60307 flow [2025-04-14 01:22:00,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 2463 transitions, 58410 flow, removed 776 selfloop flow, removed 7 redundant places. [2025-04-14 01:22:01,003 INFO L231 Difference]: Finished difference. Result has 511 places, 2210 transitions, 52458 flow [2025-04-14 01:22:01,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44618, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=610, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=52458, PETRI_PLACES=511, PETRI_TRANSITIONS=2210} [2025-04-14 01:22:01,005 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 480 predicate places. [2025-04-14 01:22:01,005 INFO L485 AbstractCegarLoop]: Abstraction has has 511 places, 2210 transitions, 52458 flow [2025-04-14 01:22:01,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 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:22:01,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:01,005 INFO L206 CegarLoopForPetriNet]: trace histogram [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:22:01,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:22:01,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:01,206 INFO L403 AbstractCegarLoop]: === Iteration 40 === 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:22:01,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 979696130, now seen corresponding path program 3 times [2025-04-14 01:22:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:01,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-04-14 01:22:01,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:22:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:01,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:01,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:01,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:22:01,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:01,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-04-14 01:22:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326592241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:01,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328205752] [2025-04-14 01:22:01,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:22:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:01,716 INFO L229 MonitoredProcess]: Starting monitored process 21 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:22:01,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:22:01,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:01,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:01,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:22:01,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:01,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:22:01,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:02,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:02,230 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:02,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 79 [2025-04-14 01:22:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:02,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:03,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:03,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:22:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328205752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:03,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-14 01:22:03,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261120731] [2025-04-14 01:22:03,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:03,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:22:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:03,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:22:03,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:22:03,244 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:03,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 2210 transitions, 52458 flow. Second operand has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 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:22:03,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:14,378 INFO L116 PetriNetUnfolderBase]: 13367/19563 cut-off events. [2025-04-14 01:22:14,378 INFO L117 PetriNetUnfolderBase]: For 436500/436500 co-relation queries the response was YES. [2025-04-14 01:22:14,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205442 conditions, 19563 events. 13367/19563 cut-off events. For 436500/436500 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 122782 event pairs, 565 based on Foata normal form. 2/18958 useless extension candidates. Maximal degree in co-relation 205280. Up to 13664 conditions per place. [2025-04-14 01:22:14,860 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1630 selfloop transitions, 1307 changer transitions 10/2947 dead transitions. [2025-04-14 01:22:14,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 2947 transitions, 72085 flow [2025-04-14 01:22:14,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-14 01:22:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-14 01:22:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 633 transitions. [2025-04-14 01:22:14,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3190524193548387 [2025-04-14 01:22:14,863 INFO L175 Difference]: Start difference. First operand has 511 places, 2210 transitions, 52458 flow. Second operand 62 states and 633 transitions. [2025-04-14 01:22:14,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 2947 transitions, 72085 flow [2025-04-14 01:22:22,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 2947 transitions, 70883 flow, removed 482 selfloop flow, removed 7 redundant places. [2025-04-14 01:22:22,643 INFO L231 Difference]: Finished difference. Result has 593 places, 2660 transitions, 65743 flow [2025-04-14 01:22:22,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51470, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=939, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=65743, PETRI_PLACES=593, PETRI_TRANSITIONS=2660} [2025-04-14 01:22:22,645 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 562 predicate places. [2025-04-14 01:22:22,645 INFO L485 AbstractCegarLoop]: Abstraction has has 593 places, 2660 transitions, 65743 flow [2025-04-14 01:22:22,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 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:22:22,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:22,646 INFO L206 CegarLoopForPetriNet]: trace histogram [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:22:22,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 01:22:22,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 01:22:22,846 INFO L403 AbstractCegarLoop]: === Iteration 41 === 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:22:22,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1307155926, now seen corresponding path program 4 times [2025-04-14 01:22:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:22,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-04-14 01:22:22,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:22,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:22,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:22,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:22,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:23,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-04-14 01:22:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:23,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179825030] [2025-04-14 01:22:23,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:23,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:23,397 INFO L229 MonitoredProcess]: Starting monitored process 22 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:22:23,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:22:23,439 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:23,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:23,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:23,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:23,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:22:23,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:23,987 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:23,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-14 01:22:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:24,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:24,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:24,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 109 [2025-04-14 01:22:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179825030] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:24,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2025-04-14 01:22:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141238801] [2025-04-14 01:22:24,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:24,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:22:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:24,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:22:24,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:22:24,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:24,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 2660 transitions, 65743 flow. Second operand has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 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:22:24,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:24,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:24,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:36,101 INFO L116 PetriNetUnfolderBase]: 14142/20744 cut-off events. [2025-04-14 01:22:36,101 INFO L117 PetriNetUnfolderBase]: For 512781/512781 co-relation queries the response was YES. [2025-04-14 01:22:36,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230474 conditions, 20744 events. 14142/20744 cut-off events. For 512781/512781 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 131688 event pairs, 827 based on Foata normal form. 2/20138 useless extension candidates. Maximal degree in co-relation 230286. Up to 18432 conditions per place. [2025-04-14 01:22:36,687 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2330 selfloop transitions, 625 changer transitions 6/2961 dead transitions. [2025-04-14 01:22:36,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 2961 transitions, 76373 flow [2025-04-14 01:22:36,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:22:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:22:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 385 transitions. [2025-04-14 01:22:36,688 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30849358974358976 [2025-04-14 01:22:36,688 INFO L175 Difference]: Start difference. First operand has 593 places, 2660 transitions, 65743 flow. Second operand 39 states and 385 transitions. [2025-04-14 01:22:36,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 2961 transitions, 76373 flow [2025-04-14 01:22:47,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 2961 transitions, 73038 flow, removed 1480 selfloop flow, removed 10 redundant places. [2025-04-14 01:22:47,422 INFO L231 Difference]: Finished difference. Result has 635 places, 2800 transitions, 67279 flow [2025-04-14 01:22:47,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=63174, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=67279, PETRI_PLACES=635, PETRI_TRANSITIONS=2800} [2025-04-14 01:22:47,425 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 604 predicate places. [2025-04-14 01:22:47,425 INFO L485 AbstractCegarLoop]: Abstraction has has 635 places, 2800 transitions, 67279 flow [2025-04-14 01:22:47,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 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:22:47,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:47,425 INFO L206 CegarLoopForPetriNet]: trace histogram [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:22:47,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-14 01:22:47,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:47,626 INFO L403 AbstractCegarLoop]: === Iteration 42 === 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:22:47,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash -582836770, now seen corresponding path program 5 times [2025-04-14 01:22:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:47,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237800074] [2025-04-14 01:22:47,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:47,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:47,641 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:47,641 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:48,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:48,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237800074] [2025-04-14 01:22:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237800074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:48,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009667941] [2025-04-14 01:22:48,640 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:48,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:48,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:48,643 INFO L229 MonitoredProcess]: Starting monitored process 23 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:22:48,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:22:48,687 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:48,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:48,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:48,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:22:48,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:49,244 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:49,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-14 01:22:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:49,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:50,111 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:50,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 255 treesize of output 113 [2025-04-14 01:22:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009667941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:50,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 36 [2025-04-14 01:22:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951973850] [2025-04-14 01:22:50,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:50,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 01:22:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 01:22:50,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 01:22:50,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:50,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 2800 transitions, 67279 flow. Second operand has 38 states, 38 states have (on average 4.842105263157895) internal successors, (184), 38 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:22:50,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:50,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:50,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:06,604 INFO L116 PetriNetUnfolderBase]: 14726/21602 cut-off events. [2025-04-14 01:23:06,604 INFO L117 PetriNetUnfolderBase]: For 537713/537713 co-relation queries the response was YES. [2025-04-14 01:23:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242822 conditions, 21602 events. 14726/21602 cut-off events. For 537713/537713 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 138061 event pairs, 892 based on Foata normal form. 2/20960 useless extension candidates. Maximal degree in co-relation 242621. Up to 18672 conditions per place. [2025-04-14 01:23:07,020 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 2208 selfloop transitions, 939 changer transitions 7/3154 dead transitions. [2025-04-14 01:23:07,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 3154 transitions, 79280 flow [2025-04-14 01:23:07,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-14 01:23:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-14 01:23:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 516 transitions. [2025-04-14 01:23:07,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28289473684210525 [2025-04-14 01:23:07,022 INFO L175 Difference]: Start difference. First operand has 635 places, 2800 transitions, 67279 flow. Second operand 57 states and 516 transitions. [2025-04-14 01:23:07,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 3154 transitions, 79280 flow [2025-04-14 01:23:19,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 3154 transitions, 78339 flow, removed 268 selfloop flow, removed 11 redundant places. [2025-04-14 01:23:19,693 INFO L231 Difference]: Finished difference. Result has 693 places, 2928 transitions, 71867 flow [2025-04-14 01:23:19,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66372, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=818, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=71867, PETRI_PLACES=693, PETRI_TRANSITIONS=2928} [2025-04-14 01:23:19,695 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 662 predicate places. [2025-04-14 01:23:19,695 INFO L485 AbstractCegarLoop]: Abstraction has has 693 places, 2928 transitions, 71867 flow [2025-04-14 01:23:19,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.842105263157895) internal successors, (184), 38 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:19,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:19,696 INFO L206 CegarLoopForPetriNet]: trace histogram [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:23:19,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-14 01:23:19,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:19,896 INFO L403 AbstractCegarLoop]: === Iteration 43 === 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:23:19,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -385023356, now seen corresponding path program 6 times [2025-04-14 01:23:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:19,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037347580] [2025-04-14 01:23:19,898 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:23:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:19,903 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:19,909 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:19,910 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:23:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:20,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037347580] [2025-04-14 01:23:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037347580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:20,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460438231] [2025-04-14 01:23:20,470 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:23:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:20,472 INFO L229 MonitoredProcess]: Starting monitored process 24 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:23:20,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:23:20,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:20,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:20,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:23:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:20,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:23:20,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:20,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:23:20,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:20,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 72 [2025-04-14 01:23:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:21,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:21,743 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:21,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:23:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:21,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460438231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:21,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:21,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-14 01:23:21,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688394241] [2025-04-14 01:23:21,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:21,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:23:21,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:21,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:23:21,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:23:21,951 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:21,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 2928 transitions, 71867 flow. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 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:23:21,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:21,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:21,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:35,170 INFO L116 PetriNetUnfolderBase]: 14794/21726 cut-off events. [2025-04-14 01:23:35,170 INFO L117 PetriNetUnfolderBase]: For 554826/554826 co-relation queries the response was YES. [2025-04-14 01:23:35,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249059 conditions, 21726 events. 14794/21726 cut-off events. For 554826/554826 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 139120 event pairs, 626 based on Foata normal form. 2/21066 useless extension candidates. Maximal degree in co-relation 248844. Up to 15047 conditions per place. [2025-04-14 01:23:35,543 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1751 selfloop transitions, 1442 changer transitions 10/3203 dead transitions. [2025-04-14 01:23:35,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 3203 transitions, 82105 flow [2025-04-14 01:23:35,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 01:23:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 01:23:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 535 transitions. [2025-04-14 01:23:35,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.334375 [2025-04-14 01:23:35,546 INFO L175 Difference]: Start difference. First operand has 693 places, 2928 transitions, 71867 flow. Second operand 50 states and 535 transitions. [2025-04-14 01:23:35,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 3203 transitions, 82105 flow [2025-04-14 01:23:47,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 3203 transitions, 80484 flow, removed 402 selfloop flow, removed 18 redundant places. [2025-04-14 01:23:48,034 INFO L231 Difference]: Finished difference. Result has 736 places, 2959 transitions, 74417 flow [2025-04-14 01:23:48,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70352, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1419, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=74417, PETRI_PLACES=736, PETRI_TRANSITIONS=2959} [2025-04-14 01:23:48,037 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 705 predicate places. [2025-04-14 01:23:48,037 INFO L485 AbstractCegarLoop]: Abstraction has has 736 places, 2959 transitions, 74417 flow [2025-04-14 01:23:48,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 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:23:48,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:48,037 INFO L206 CegarLoopForPetriNet]: trace histogram [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:23:48,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:23:48,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:48,238 INFO L403 AbstractCegarLoop]: === Iteration 44 === 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:23:48,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 163526932, now seen corresponding path program 7 times [2025-04-14 01:23:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:48,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383555347] [2025-04-14 01:23:48,239 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:48,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:23:48,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:48,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:48,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:23:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:48,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383555347] [2025-04-14 01:23:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383555347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:48,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372146852] [2025-04-14 01:23:48,823 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:48,825 INFO L229 MonitoredProcess]: Starting monitored process 25 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:23:48,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:23:48,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:23:48,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:48,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:48,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:48,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:23:48,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:49,504 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-14 01:23:49,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 93 [2025-04-14 01:23:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:49,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:50,415 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:50,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 159 [2025-04-14 01:23:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372146852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:50,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-14 01:23:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334681941] [2025-04-14 01:23:50,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:50,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:23:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:50,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:23:50,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:23:50,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:50,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 2959 transitions, 74417 flow. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 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:23:50,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:50,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:50,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:05,996 INFO L116 PetriNetUnfolderBase]: 15130/22218 cut-off events. [2025-04-14 01:24:05,996 INFO L117 PetriNetUnfolderBase]: For 652732/652732 co-relation queries the response was YES. [2025-04-14 01:24:06,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262614 conditions, 22218 events. 15130/22218 cut-off events. For 652732/652732 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 142730 event pairs, 870 based on Foata normal form. 1/22032 useless extension candidates. Maximal degree in co-relation 262389. Up to 19603 conditions per place. [2025-04-14 01:24:06,710 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2521 selfloop transitions, 719 changer transitions 6/3246 dead transitions. [2025-04-14 01:24:06,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 3246 transitions, 85146 flow [2025-04-14 01:24:06,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 01:24:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-14 01:24:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 454 transitions. [2025-04-14 01:24:06,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31527777777777777 [2025-04-14 01:24:06,711 INFO L175 Difference]: Start difference. First operand has 736 places, 2959 transitions, 74417 flow. Second operand 45 states and 454 transitions. [2025-04-14 01:24:06,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 3246 transitions, 85146 flow [2025-04-14 01:24:21,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 3246 transitions, 83648 flow, removed 189 selfloop flow, removed 27 redundant places. [2025-04-14 01:24:21,596 INFO L231 Difference]: Finished difference. Result has 769 places, 3065 transitions, 76883 flow [2025-04-14 01:24:21,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72949, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=625, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=76883, PETRI_PLACES=769, PETRI_TRANSITIONS=3065} [2025-04-14 01:24:21,598 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 738 predicate places. [2025-04-14 01:24:21,598 INFO L485 AbstractCegarLoop]: Abstraction has has 769 places, 3065 transitions, 76883 flow [2025-04-14 01:24:21,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 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:24:21,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:21,598 INFO L206 CegarLoopForPetriNet]: trace histogram [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:24:21,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:24:21,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:21,799 INFO L403 AbstractCegarLoop]: === Iteration 45 === 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:24:21,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1437370458, now seen corresponding path program 8 times [2025-04-14 01:24:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:21,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214021851] [2025-04-14 01:24:21,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:24:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:21,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:21,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:21,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:22,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214021851] [2025-04-14 01:24:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214021851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:22,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055423426] [2025-04-14 01:24:22,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:24:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:22,368 INFO L229 MonitoredProcess]: Starting monitored process 26 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:24:22,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:24:22,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:22,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:22,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:22,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:22,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:24:22,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:23,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:23,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:23,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-14 01:24:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:23,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:23,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:23,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:24:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055423426] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:23,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-14 01:24:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568864187] [2025-04-14 01:24:23,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:23,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:24:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:23,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:24:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:24:23,956 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:23,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 3065 transitions, 76883 flow. Second operand has 35 states, 35 states have (on average 4.685714285714286) internal successors, (164), 35 states have internal predecessors, (164), 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:24:23,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:23,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:23,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:39,331 INFO L116 PetriNetUnfolderBase]: 15872/23283 cut-off events. [2025-04-14 01:24:39,332 INFO L117 PetriNetUnfolderBase]: For 776092/776092 co-relation queries the response was YES. [2025-04-14 01:24:39,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283819 conditions, 23283 events. 15872/23283 cut-off events. For 776092/776092 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 150015 event pairs, 659 based on Foata normal form. 3/23111 useless extension candidates. Maximal degree in co-relation 283577. Up to 16065 conditions per place. [2025-04-14 01:24:40,040 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2079 selfloop transitions, 1397 changer transitions 11/3487 dead transitions. [2025-04-14 01:24:40,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 3487 transitions, 91876 flow [2025-04-14 01:24:40,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 01:24:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 01:24:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 523 transitions. [2025-04-14 01:24:40,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.326875 [2025-04-14 01:24:40,042 INFO L175 Difference]: Start difference. First operand has 769 places, 3065 transitions, 76883 flow. Second operand 50 states and 523 transitions. [2025-04-14 01:24:40,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 3487 transitions, 91876 flow [2025-04-14 01:24:57,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 804 places, 3487 transitions, 90190 flow, removed 494 selfloop flow, removed 14 redundant places. [2025-04-14 01:24:57,627 INFO L231 Difference]: Finished difference. Result has 813 places, 3219 transitions, 83478 flow [2025-04-14 01:24:57,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=75234, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=83478, PETRI_PLACES=813, PETRI_TRANSITIONS=3219} [2025-04-14 01:24:57,629 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 782 predicate places. [2025-04-14 01:24:57,629 INFO L485 AbstractCegarLoop]: Abstraction has has 813 places, 3219 transitions, 83478 flow [2025-04-14 01:24:57,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.685714285714286) internal successors, (164), 35 states have internal predecessors, (164), 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:24:57,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:57,629 INFO L206 CegarLoopForPetriNet]: trace histogram [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:24:57,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:24:57,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-14 01:24:57,830 INFO L403 AbstractCegarLoop]: === Iteration 46 === 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:24:57,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1604502628, now seen corresponding path program 9 times [2025-04-14 01:24:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:57,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-04-14 01:24:57,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:57,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:57,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:57,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:58,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-04-14 01:24:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820229586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:58,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693606731] [2025-04-14 01:24:58,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:58,479 INFO L229 MonitoredProcess]: Starting monitored process 27 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:24:58,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:24:58,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:58,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:58,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:58,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:58,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:24:58,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:58,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:58,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:58,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 99 [2025-04-14 01:24:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:59,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:59,869 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:59,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:25:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693606731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:00,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:25:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70699376] [2025-04-14 01:25:00,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:00,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:25:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:00,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:25:00,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:25:00,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:25:00,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 3219 transitions, 83478 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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:25:00,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:00,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:25:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:20,738 INFO L116 PetriNetUnfolderBase]: 17087/25008 cut-off events. [2025-04-14 01:25:20,738 INFO L117 PetriNetUnfolderBase]: For 905779/905779 co-relation queries the response was YES. [2025-04-14 01:25:21,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318268 conditions, 25008 events. 17087/25008 cut-off events. For 905779/905779 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 162076 event pairs, 662 based on Foata normal form. 3/24830 useless extension candidates. Maximal degree in co-relation 318017. Up to 18745 conditions per place. [2025-04-14 01:25:21,335 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2228 selfloop transitions, 1673 changer transitions 13/3914 dead transitions. [2025-04-14 01:25:21,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 3914 transitions, 106419 flow [2025-04-14 01:25:21,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-14 01:25:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2025-04-14 01:25:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 697 transitions. [2025-04-14 01:25:21,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2025-04-14 01:25:21,338 INFO L175 Difference]: Start difference. First operand has 813 places, 3219 transitions, 83478 flow. Second operand 68 states and 697 transitions. [2025-04-14 01:25:21,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 3914 transitions, 106419 flow [2025-04-14 01:25:44,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 856 places, 3914 transitions, 102878 flow, removed 1214 selfloop flow, removed 23 redundant places. [2025-04-14 01:25:44,366 INFO L231 Difference]: Finished difference. Result has 877 places, 3650 transitions, 96921 flow [2025-04-14 01:25:44,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80929, PETRI_DIFFERENCE_MINUEND_PLACES=789, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=96921, PETRI_PLACES=877, PETRI_TRANSITIONS=3650} [2025-04-14 01:25:44,368 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 846 predicate places. [2025-04-14 01:25:44,368 INFO L485 AbstractCegarLoop]: Abstraction has has 877 places, 3650 transitions, 96921 flow [2025-04-14 01:25:44,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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:25:44,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:25:44,368 INFO L206 CegarLoopForPetriNet]: trace histogram [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:25:44,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:25:44,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-14 01:25:44,569 INFO L403 AbstractCegarLoop]: === Iteration 47 === 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:25:44,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:25:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1262251810, now seen corresponding path program 10 times [2025-04-14 01:25:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:25:44,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878052658] [2025-04-14 01:25:44,570 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:25:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:25:44,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:44,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:44,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:25:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:25:44,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878052658] [2025-04-14 01:25:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878052658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:25:44,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942526707] [2025-04-14 01:25:44,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:25:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:25:44,938 INFO L229 MonitoredProcess]: Starting monitored process 28 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:25:44,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:25:44,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:45,000 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:45,001 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:25:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:45,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:25:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:25:45,379 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:45,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 101 [2025-04-14 01:25:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:25:45,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:46,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:46,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 255 treesize of output 113 [2025-04-14 01:25:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942526707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:46,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:46,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 29 [2025-04-14 01:25:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023933067] [2025-04-14 01:25:46,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:46,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 01:25:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:46,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 01:25:46,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-04-14 01:25:46,353 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:25:46,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 3650 transitions, 96921 flow. Second operand has 31 states, 31 states have (on average 4.870967741935484) internal successors, (151), 31 states have internal predecessors, (151), 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:25:46,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:46,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:25:46,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:06,099 INFO L116 PetriNetUnfolderBase]: 17808/26025 cut-off events. [2025-04-14 01:26:06,100 INFO L117 PetriNetUnfolderBase]: For 907919/907919 co-relation queries the response was YES. [2025-04-14 01:26:07,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335086 conditions, 26025 events. 17808/26025 cut-off events. For 907919/907919 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 169161 event pairs, 865 based on Foata normal form. 2/25819 useless extension candidates. Maximal degree in co-relation 334819. Up to 23977 conditions per place. [2025-04-14 01:26:07,246 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 3138 selfloop transitions, 876 changer transitions 6/4020 dead transitions. [2025-04-14 01:26:07,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 4020 transitions, 112911 flow [2025-04-14 01:26:07,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:26:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:26:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 395 transitions. [2025-04-14 01:26:07,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3248355263157895 [2025-04-14 01:26:07,247 INFO L175 Difference]: Start difference. First operand has 877 places, 3650 transitions, 96921 flow. Second operand 38 states and 395 transitions. [2025-04-14 01:26:07,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 4020 transitions, 112911 flow [2025-04-14 01:26:32,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 4020 transitions, 109247 flow, removed 1595 selfloop flow, removed 9 redundant places. [2025-04-14 01:26:32,325 INFO L231 Difference]: Finished difference. Result has 927 places, 3916 transitions, 103112 flow [2025-04-14 01:26:32,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93308, PETRI_DIFFERENCE_MINUEND_PLACES=866, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=634, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=103112, PETRI_PLACES=927, PETRI_TRANSITIONS=3916} [2025-04-14 01:26:32,327 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 896 predicate places. [2025-04-14 01:26:32,327 INFO L485 AbstractCegarLoop]: Abstraction has has 927 places, 3916 transitions, 103112 flow [2025-04-14 01:26:32,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.870967741935484) internal successors, (151), 31 states have internal predecessors, (151), 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:26:32,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:32,328 INFO L206 CegarLoopForPetriNet]: trace histogram [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:26:32,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-14 01:26:32,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-14 01:26:32,528 INFO L403 AbstractCegarLoop]: === Iteration 48 === 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:26:32,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash 656918024, now seen corresponding path program 11 times [2025-04-14 01:26:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:32,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997190846] [2025-04-14 01:26:32,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:26:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:32,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:26:32,541 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:32,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:32,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:33,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997190846] [2025-04-14 01:26:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997190846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:33,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092964129] [2025-04-14 01:26:33,417 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:26:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:33,419 INFO L229 MonitoredProcess]: Starting monitored process 29 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:26:33,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:26:33,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:26:33,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:33,485 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:33,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:33,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:26:33,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:34,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:34,118 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:34,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 93 [2025-04-14 01:26:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:26:34,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:35,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:35,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 111 [2025-04-14 01:26:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092964129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:35,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 35 [2025-04-14 01:26:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50023149] [2025-04-14 01:26:35,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:35,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:26:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:35,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:26:35,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:26:35,343 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:26:35,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 3916 transitions, 103112 flow. Second operand has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 states have internal predecessors, (180), 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:26:35,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:35,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:26:35,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:01,277 INFO L116 PetriNetUnfolderBase]: 19809/29077 cut-off events. [2025-04-14 01:27:01,278 INFO L117 PetriNetUnfolderBase]: For 1043931/1043931 co-relation queries the response was YES. [2025-04-14 01:27:01,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377325 conditions, 29077 events. 19809/29077 cut-off events. For 1043931/1043931 co-relation queries the response was YES. Maximal size of possible extension queue 1678. Compared 193556 event pairs, 821 based on Foata normal form. 2/28855 useless extension candidates. Maximal degree in co-relation 377033. Up to 22855 conditions per place. [2025-04-14 01:27:02,111 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 3022 selfloop transitions, 1703 changer transitions 7/4732 dead transitions. [2025-04-14 01:27:02,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 4732 transitions, 131554 flow [2025-04-14 01:27:02,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-14 01:27:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-14 01:27:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 626 transitions. [2025-04-14 01:27:02,113 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3056640625 [2025-04-14 01:27:02,113 INFO L175 Difference]: Start difference. First operand has 927 places, 3916 transitions, 103112 flow. Second operand 64 states and 626 transitions. [2025-04-14 01:27:02,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 4732 transitions, 131554 flow [2025-04-14 01:27:34,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 4732 transitions, 129715 flow, removed 782 selfloop flow, removed 4 redundant places. [2025-04-14 01:27:34,130 INFO L231 Difference]: Finished difference. Result has 1006 places, 4404 transitions, 119967 flow [2025-04-14 01:27:34,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=101323, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=119967, PETRI_PLACES=1006, PETRI_TRANSITIONS=4404} [2025-04-14 01:27:34,132 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 975 predicate places. [2025-04-14 01:27:34,133 INFO L485 AbstractCegarLoop]: Abstraction has has 1006 places, 4404 transitions, 119967 flow [2025-04-14 01:27:34,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.864864864864865) internal successors, (180), 37 states have internal predecessors, (180), 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:27:34,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:34,133 INFO L206 CegarLoopForPetriNet]: trace histogram [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:27:34,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-14 01:27:34,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:34,334 INFO L403 AbstractCegarLoop]: === Iteration 49 === 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:27:34,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 117101582, now seen corresponding path program 12 times [2025-04-14 01:27:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:34,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696813130] [2025-04-14 01:27:34,335 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:27:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:34,340 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:27:34,346 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:34,346 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:27:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:27:34,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:34,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696813130] [2025-04-14 01:27:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696813130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:27:34,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567164241] [2025-04-14 01:27:34,889 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:27:34,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:27:34,891 INFO L229 MonitoredProcess]: Starting monitored process 30 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:27:34,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:27:34,942 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:27:34,958 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:34,958 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:27:34,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:34,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:27:34,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:27:35,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:27:35,425 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:35,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 75 [2025-04-14 01:27:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:27:35,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:27:36,047 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:36,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:27:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:27:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567164241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:27:36,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:27:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-14 01:27:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810362549] [2025-04-14 01:27:36,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:27:36,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:27:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:36,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:27:36,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:27:36,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:27:36,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 4404 transitions, 119967 flow. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 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:27:36,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:36,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:27:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:08,423 INFO L116 PetriNetUnfolderBase]: 21167/31200 cut-off events. [2025-04-14 01:28:08,423 INFO L117 PetriNetUnfolderBase]: For 1192852/1192852 co-relation queries the response was YES. [2025-04-14 01:28:09,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419961 conditions, 31200 events. 21167/31200 cut-off events. For 1192852/1192852 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 211566 event pairs, 679 based on Foata normal form. 3/30971 useless extension candidates. Maximal degree in co-relation 419648. Up to 21383 conditions per place. [2025-04-14 01:28:09,680 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2659 selfloop transitions, 2628 changer transitions 15/5302 dead transitions. [2025-04-14 01:28:09,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1092 places, 5302 transitions, 152379 flow [2025-04-14 01:28:09,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-14 01:28:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2025-04-14 01:28:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 857 transitions. [2025-04-14 01:28:09,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3078304597701149 [2025-04-14 01:28:09,682 INFO L175 Difference]: Start difference. First operand has 1006 places, 4404 transitions, 119967 flow. Second operand 87 states and 857 transitions. [2025-04-14 01:28:09,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1092 places, 5302 transitions, 152379 flow [2025-04-14 01:28:47,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1080 places, 5302 transitions, 148642 flow, removed 1676 selfloop flow, removed 12 redundant places. [2025-04-14 01:28:47,346 INFO L231 Difference]: Finished difference. Result has 1111 places, 4978 transitions, 141769 flow [2025-04-14 01:28:47,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=116929, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=141769, PETRI_PLACES=1111, PETRI_TRANSITIONS=4978} [2025-04-14 01:28:47,349 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1080 predicate places. [2025-04-14 01:28:47,349 INFO L485 AbstractCegarLoop]: Abstraction has has 1111 places, 4978 transitions, 141769 flow [2025-04-14 01:28:47,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 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:28:47,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:47,349 INFO L206 CegarLoopForPetriNet]: trace histogram [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:28:47,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:28:47,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-14 01:28:47,550 INFO L403 AbstractCegarLoop]: === Iteration 50 === 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:28:47,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1834301262, now seen corresponding path program 13 times [2025-04-14 01:28:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:47,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080690565] [2025-04-14 01:28:47,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:28:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:47,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:28:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:28:47,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:28:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:48,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080690565] [2025-04-14 01:28:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080690565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:48,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78195992] [2025-04-14 01:28:48,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:28:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:48,221 INFO L229 MonitoredProcess]: Starting monitored process 31 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:28:48,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 01:28:48,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:28:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:48,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:28:48,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:48,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:28:48,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:48,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:28:48,714 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:48,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-14 01:28:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:49,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:50,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-14 01:28:50,714 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:50,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-14 01:28:50,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 228 [2025-04-14 01:28:50,837 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:50,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 283 [2025-04-14 01:28:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:28:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78195992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:51,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 34 [2025-04-14 01:28:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16348880] [2025-04-14 01:28:51,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:51,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:28:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:51,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:28:51,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:28:51,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:28:51,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1111 places, 4978 transitions, 141769 flow. Second operand has 36 states, 36 states have (on average 4.694444444444445) internal successors, (169), 36 states have internal predecessors, (169), 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:28:51,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:51,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:28:51,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:29:22,736 INFO L116 PetriNetUnfolderBase]: 21690/31985 cut-off events. [2025-04-14 01:29:22,736 INFO L117 PetriNetUnfolderBase]: For 1303237/1303237 co-relation queries the response was YES. [2025-04-14 01:29:24,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445335 conditions, 31985 events. 21690/31985 cut-off events. For 1303237/1303237 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 217502 event pairs, 1046 based on Foata normal form. 3/31732 useless extension candidates. Maximal degree in co-relation 444990. Up to 29042 conditions per place. [2025-04-14 01:29:24,314 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 4081 selfloop transitions, 1196 changer transitions 6/5283 dead transitions. [2025-04-14 01:29:24,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1153 places, 5283 transitions, 158466 flow [2025-04-14 01:29:24,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 01:29:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 01:29:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 471 transitions. [2025-04-14 01:29:24,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31997282608695654 [2025-04-14 01:29:24,316 INFO L175 Difference]: Start difference. First operand has 1111 places, 4978 transitions, 141769 flow. Second operand 46 states and 471 transitions. [2025-04-14 01:29:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1153 places, 5283 transitions, 158466 flow [2025-04-14 01:30:07,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1126 places, 5283 transitions, 155788 flow, removed 931 selfloop flow, removed 27 redundant places. [2025-04-14 01:30:08,045 INFO L231 Difference]: Finished difference. Result has 1138 places, 5140 transitions, 146864 flow [2025-04-14 01:30:08,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=139102, PETRI_DIFFERENCE_MINUEND_PLACES=1081, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=146864, PETRI_PLACES=1138, PETRI_TRANSITIONS=5140} [2025-04-14 01:30:08,048 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1107 predicate places. [2025-04-14 01:30:08,048 INFO L485 AbstractCegarLoop]: Abstraction has has 1138 places, 5140 transitions, 146864 flow [2025-04-14 01:30:08,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.694444444444445) internal successors, (169), 36 states have internal predecessors, (169), 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:30:08,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:08,048 INFO L206 CegarLoopForPetriNet]: trace histogram [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:30:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 01:30:08,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 01:30:08,249 INFO L403 AbstractCegarLoop]: === Iteration 51 === 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:30:08,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 852350852, now seen corresponding path program 14 times [2025-04-14 01:30:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:08,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146897571] [2025-04-14 01:30:08,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:30:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:08,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:30:08,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:30:08,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:30:08,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:30:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:08,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146897571] [2025-04-14 01:30:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146897571] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:30:08,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821905104] [2025-04-14 01:30:08,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:30:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:30:08,925 INFO L229 MonitoredProcess]: Starting monitored process 32 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:30:08,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 01:30:08,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:30:08,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:30:08,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:30:08,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:30:08,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:30:09,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:30:09,381 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:09,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 97 [2025-04-14 01:30:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:30:09,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:30:10,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:10,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-14 01:30:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:30:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821905104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:30:10,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:30:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-14 01:30:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054533169] [2025-04-14 01:30:10,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:30:10,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:30:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:10,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:30:10,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:30:10,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:30:10,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1138 places, 5140 transitions, 146864 flow. Second operand has 33 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 33 states have internal predecessors, (156), 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:30:10,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:10,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:30:10,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:30:46,679 INFO L116 PetriNetUnfolderBase]: 22212/32884 cut-off events. [2025-04-14 01:30:46,679 INFO L117 PetriNetUnfolderBase]: For 1372044/1372044 co-relation queries the response was YES. [2025-04-14 01:30:48,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461362 conditions, 32884 events. 22212/32884 cut-off events. For 1372044/1372044 co-relation queries the response was YES. Maximal size of possible extension queue 1883. Compared 225912 event pairs, 868 based on Foata normal form. 3/32625 useless extension candidates. Maximal degree in co-relation 461011. Up to 25756 conditions per place. [2025-04-14 01:30:48,546 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 3309 selfloop transitions, 2331 changer transitions 16/5656 dead transitions. [2025-04-14 01:30:48,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 5656 transitions, 168737 flow [2025-04-14 01:30:48,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-14 01:30:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-04-14 01:30:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 745 transitions. [2025-04-14 01:30:48,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3189212328767123 [2025-04-14 01:30:48,548 INFO L175 Difference]: Start difference. First operand has 1138 places, 5140 transitions, 146864 flow. Second operand 73 states and 745 transitions. [2025-04-14 01:30:48,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 5656 transitions, 168737 flow Received shutdown request... [2025-04-14 01:31:15,769 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:31:15,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 01:31:15,815 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:31:15,815 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:31:15,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:15,971 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:31:15,975 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:31:15,975 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:31:15,975 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:31:15,978 INFO L422 BasicCegarLoop]: Path program histogram: [25, 14, 7, 1, 1, 1, 1, 1] [2025-04-14 01:31:15,986 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:31:15,986 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:31:15,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:31:15 BasicIcfg [2025-04-14 01:31:15,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:31:15,997 INFO L158 Benchmark]: Toolchain (without parser) took 776601.62ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 102.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-14 01:31:15,997 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:31:15,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.82ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 87.0MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:31:15,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.38ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:31:15,997 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 84.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:31:15,997 INFO L158 Benchmark]: IcfgBuilder took 559.66ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 38.0MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 01:31:15,998 INFO L158 Benchmark]: TraceAbstraction took 775666.39ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 37.3MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2025-04-14 01:31:16,002 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 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.82ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 87.0MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.38ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 84.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 559.66ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 38.0MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 775666.39ms. Allocated memory was 142.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 37.3MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 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: 775.5s, OverallIterations: 51, TraceHistogramMax: 2, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.0s, AutomataDifference: 720.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8774 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8774 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1764 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60408 IncrementalHoareTripleChecker+Invalid, 62172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1764 mSolverCounterUnsat, 0 mSDtfsCounter, 60408 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 947 SyntacticMatches, 25 SemanticMatches, 1753 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29517 ImplicationChecksByTransitivity, 56.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146864occurred in iteration=50, InterpolantAutomatonStates: 1290, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1800 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2418 ConstructedInterpolants, 0 QuantifiedInterpolants, 66761 SizeOfPredicates, 376 NumberOfNonLiveVariables, 5560 ConjunctsInSsa, 644 ConjunctsInUnsatCore, 113 InterpolantComputations, 24 PerfectInterpolantSequences, 182/349 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown