/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:38:44,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:38:44,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:38:44,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:38:44,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:38:44,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:38:44,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:38:44,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:38:44,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:38:44,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:38:44,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:38:44,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:38:44,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:38:44,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:38:44,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:38:44,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:38:44,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:38:44,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:38:44,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:38:44,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:38:44,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:38:44,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:38:44,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:38:44,452 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 [2025-04-13 20:38:44,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:38:44,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:38:44,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:38:44,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:38:44,686 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:38:44,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-13 20:38:45,979 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93da13533/fd8ed2c428d142bf901dc89059d378bc/FLAG30c820fdd [2025-04-13 20:38:46,183 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:38:46,183 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-13 20:38:46,189 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93da13533/fd8ed2c428d142bf901dc89059d378bc/FLAG30c820fdd [2025-04-13 20:38:46,979 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93da13533/fd8ed2c428d142bf901dc89059d378bc [2025-04-13 20:38:46,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:38:46,982 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:38:46,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:38:46,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:38:46,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:38:46,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:38:46" (1/1) ... [2025-04-13 20:38:46,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f46ac52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:46, skipping insertion in model container [2025-04-13 20:38:46,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:38:46" (1/1) ... [2025-04-13 20:38:47,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:38:47,166 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-max-array-hom.wvr.c[2625,2638] [2025-04-13 20:38:47,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:38:47,189 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:38:47,221 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-max-array-hom.wvr.c[2625,2638] [2025-04-13 20:38:47,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:38:47,234 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:38:47,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47 WrapperNode [2025-04-13 20:38:47,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:38:47,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:38:47,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:38:47,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:38:47,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,270 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-13 20:38:47,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:38:47,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:38:47,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:38:47,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:38:47,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,292 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-13 20:38:47,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:38:47,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:38:47,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:38:47,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:38:47,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (1/1) ... [2025-04-13 20:38:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:38:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:47,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:38:47,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:38:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:38:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:38:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:38:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:38:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:38:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:38:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:38:47,352 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:38:47,425 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:38:47,426 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:38:47,613 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:38:47,614 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:38:47,614 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:38:47,768 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:38:47,770 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:38:47,774 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:38:47,778 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:38:47,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:38:47 BoogieIcfgContainer [2025-04-13 20:38:47,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:38:47,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:38:47,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:38:47,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:38:47,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:38:46" (1/3) ... [2025-04-13 20:38:47,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec894e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:38:47, skipping insertion in model container [2025-04-13 20:38:47,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:38:47" (2/3) ... [2025-04-13 20:38:47,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec894e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:38:47, skipping insertion in model container [2025-04-13 20:38:47,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:38:47" (3/3) ... [2025-04-13 20:38:47,805 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-04-13 20:38:47,817 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:38:47,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array-hom.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:38:47,818 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:38:47,863 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:38:47,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:38:47,914 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:38:47,915 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:38:47,916 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 32 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-13 20:38:47,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:38:47,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:38:47,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:38:47,938 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;@647ec65f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:38:47,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:38:47,949 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:38:47,951 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:38:47,951 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:38:47,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:47,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:47,955 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-13 20:38:47,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1547839771, now seen corresponding path program 1 times [2025-04-13 20:38:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:47,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223123816] [2025-04-13 20:38:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:48,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:38:48,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:38:48,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:48,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:48,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223123816] [2025-04-13 20:38:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223123816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:48,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:38:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548457966] [2025-04-13 20:38:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:48,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:38:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:48,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:38:48,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:38:48,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:48,252 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-13 20:38:48,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:48,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:48,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:48,386 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-13 20:38:48,386 INFO L117 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-04-13 20:38:48,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1974 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-13 20:38:48,395 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-13 20:38:48,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-13 20:38:48,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:38:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:38:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:38:48,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:38:48,406 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:38:48,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-13 20:38:48,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:38:48,444 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-13 20:38:48,446 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-13 20:38:48,449 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-13 20:38:48,449 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-13 20:38:48,449 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-13 20:38:48,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:48,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:48,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:38:48,450 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-13 20:38:48,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1048591826, now seen corresponding path program 1 times [2025-04-13 20:38:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:48,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704403994] [2025-04-13 20:38:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:38:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:38:48,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:48,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:48,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704403994] [2025-04-13 20:38:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704403994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:38:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103328483] [2025-04-13 20:38:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:48,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:38:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:48,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:38:48,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:38:48,540 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:48,540 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-13 20:38:48,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:48,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:48,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:48,623 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-13 20:38:48,623 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:38:48,624 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 1869 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-13 20:38:48,628 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-13 20:38:48,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-13 20:38:48,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:38:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:38:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 20:38:48,629 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:38:48,629 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-13 20:38:48,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-13 20:38:48,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:48,630 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-13 20:38:48,630 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-13 20:38:48,631 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-13 20:38:48,631 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-13 20:38:48,631 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-13 20:38:48,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:48,631 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-13 20:38:48,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:38:48,631 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-13 20:38:48,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 666538485, now seen corresponding path program 1 times [2025-04-13 20:38:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:48,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506058543] [2025-04-13 20:38:48,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:48,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:38:48,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:38:48,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:48,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:48,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506058543] [2025-04-13 20:38:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506058543] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:38:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689107497] [2025-04-13 20:38:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:48,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:38:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:48,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:38:48,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:38:48,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:48,716 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-13 20:38:48,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:48,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:48,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:48,803 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-13 20:38:48,804 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:38:48,804 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 1874 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-13 20:38:48,809 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-13 20:38:48,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-13 20:38:48,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:38:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:38:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:38:48,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:38:48,810 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:38:48,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-13 20:38:48,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:48,811 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-13 20:38:48,811 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-13 20:38:48,812 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 20:38:48,812 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-13 20:38:48,812 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-13 20:38:48,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:48,812 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-13 20:38:48,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:38:48,812 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-13 20:38:48,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104603, now seen corresponding path program 1 times [2025-04-13 20:38:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:48,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804470172] [2025-04-13 20:38:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:38:48,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:48,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:48,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:49,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804470172] [2025-04-13 20:38:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804470172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:49,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569638970] [2025-04-13 20:38:49,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:49,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:49,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:38:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:38:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:38:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:49,635 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-13 20:38:49,996 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 55 treesize of output 31 [2025-04-13 20:38:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:50,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:51,223 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 98 treesize of output 88 [2025-04-13 20:38:51,227 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 119 treesize of output 109 [2025-04-13 20:38:51,347 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 76 treesize of output 66 [2025-04-13 20:38:51,350 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 93 treesize of output 83 [2025-04-13 20:38:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569638970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:51,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 20:38:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151702942] [2025-04-13 20:38:51,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:51,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:38:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:51,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:38:51,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:38:51,394 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:51,394 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.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:51,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:51,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:51,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:53,536 INFO L116 PetriNetUnfolderBase]: 1364/2009 cut-off events. [2025-04-13 20:38:53,536 INFO L117 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-04-13 20:38:53,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4102 conditions, 2009 events. 1364/2009 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8757 event pairs, 19 based on Foata normal form. 1/1669 useless extension candidates. Maximal degree in co-relation 4091. Up to 998 conditions per place. [2025-04-13 20:38:53,544 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 172 selfloop transitions, 120 changer transitions 1/293 dead transitions. [2025-04-13 20:38:53,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 293 transitions, 1250 flow [2025-04-13 20:38:53,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:38:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:38:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 421 transitions. [2025-04-13 20:38:53,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3373397435897436 [2025-04-13 20:38:53,547 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 39 states and 421 transitions. [2025-04-13 20:38:53,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 293 transitions, 1250 flow [2025-04-13 20:38:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 293 transitions, 1246 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:53,550 INFO L231 Difference]: Finished difference. Result has 85 places, 156 transitions, 757 flow [2025-04-13 20:38:53,550 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=757, PETRI_PLACES=85, PETRI_TRANSITIONS=156} [2025-04-13 20:38:53,551 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2025-04-13 20:38:53,551 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 156 transitions, 757 flow [2025-04-13 20:38:53,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:53,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:53,551 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-13 20:38:53,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:53,755 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-13 20:38:53,755 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-13 20:38:53,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1613284691, now seen corresponding path program 2 times [2025-04-13 20:38:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:53,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159860580] [2025-04-13 20:38:53,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:53,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:53,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:38:53,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:38:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:54,174 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-13 20:38:54,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:54,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159860580] [2025-04-13 20:38:54,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159860580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:54,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:38:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898088325] [2025-04-13 20:38:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:54,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:38:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:54,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:38:54,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:38:54,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:54,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 156 transitions, 757 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-13 20:38:54,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:54,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:54,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:54,469 INFO L116 PetriNetUnfolderBase]: 1432/2128 cut-off events. [2025-04-13 20:38:54,469 INFO L117 PetriNetUnfolderBase]: For 5931/5931 co-relation queries the response was YES. [2025-04-13 20:38:54,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 2128 events. 1432/2128 cut-off events. For 5931/5931 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9397 event pairs, 112 based on Foata normal form. 1/1951 useless extension candidates. Maximal degree in co-relation 7219. Up to 1862 conditions per place. [2025-04-13 20:38:54,479 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 54 changer transitions 1/216 dead transitions. [2025-04-13 20:38:54,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 216 transitions, 1468 flow [2025-04-13 20:38:54,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:38:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:38:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-04-13 20:38:54,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-13 20:38:54,481 INFO L175 Difference]: Start difference. First operand has 85 places, 156 transitions, 757 flow. Second operand 10 states and 102 transitions. [2025-04-13 20:38:54,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 216 transitions, 1468 flow [2025-04-13 20:38:54,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 216 transitions, 1460 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:54,498 INFO L231 Difference]: Finished difference. Result has 99 places, 190 transitions, 1132 flow [2025-04-13 20:38:54,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=99, PETRI_TRANSITIONS=190} [2025-04-13 20:38:54,499 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2025-04-13 20:38:54,499 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 190 transitions, 1132 flow [2025-04-13 20:38:54,499 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-13 20:38:54,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:54,499 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-13 20:38:54,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:38:54,499 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-13 20:38:54,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1281555683, now seen corresponding path program 3 times [2025-04-13 20:38:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:54,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377215660] [2025-04-13 20:38:54,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:54,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:54,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:38:54,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:38:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:54,975 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-13 20:38:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:54,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377215660] [2025-04-13 20:38:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377215660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:38:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248562672] [2025-04-13 20:38:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:54,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:38:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:38:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:38:54,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:54,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 190 transitions, 1132 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-13 20:38:54,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:54,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:54,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:55,490 INFO L116 PetriNetUnfolderBase]: 1617/2411 cut-off events. [2025-04-13 20:38:55,490 INFO L117 PetriNetUnfolderBase]: For 8242/8242 co-relation queries the response was YES. [2025-04-13 20:38:55,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9649 conditions, 2411 events. 1617/2411 cut-off events. For 8242/8242 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11061 event pairs, 105 based on Foata normal form. 1/2223 useless extension candidates. Maximal degree in co-relation 9112. Up to 2055 conditions per place. [2025-04-13 20:38:55,505 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 179 selfloop transitions, 107 changer transitions 4/290 dead transitions. [2025-04-13 20:38:55,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 2294 flow [2025-04-13 20:38:55,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:38:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:38:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2025-04-13 20:38:55,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-04-13 20:38:55,507 INFO L175 Difference]: Start difference. First operand has 99 places, 190 transitions, 1132 flow. Second operand 13 states and 136 transitions. [2025-04-13 20:38:55,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 2294 flow [2025-04-13 20:38:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 290 transitions, 2187 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-13 20:38:55,524 INFO L231 Difference]: Finished difference. Result has 117 places, 250 transitions, 1860 flow [2025-04-13 20:38:55,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1860, PETRI_PLACES=117, PETRI_TRANSITIONS=250} [2025-04-13 20:38:55,525 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2025-04-13 20:38:55,525 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 250 transitions, 1860 flow [2025-04-13 20:38:55,525 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-13 20:38:55,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:55,525 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-13 20:38:55,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:38:55,526 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-13 20:38:55,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2048337357, now seen corresponding path program 4 times [2025-04-13 20:38:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:55,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486300193] [2025-04-13 20:38:55,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:38:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:55,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:55,539 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:55,539 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:38:55,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:55,916 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-13 20:38:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:55,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486300193] [2025-04-13 20:38:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486300193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:38:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854275218] [2025-04-13 20:38:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:55,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:38:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:38:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:38:55,917 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:55,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 250 transitions, 1860 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-13 20:38:55,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:55,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:55,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:56,579 INFO L116 PetriNetUnfolderBase]: 1835/2720 cut-off events. [2025-04-13 20:38:56,579 INFO L117 PetriNetUnfolderBase]: For 11256/11256 co-relation queries the response was YES. [2025-04-13 20:38:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11970 conditions, 2720 events. 1835/2720 cut-off events. For 11256/11256 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 12593 event pairs, 165 based on Foata normal form. 1/2514 useless extension candidates. Maximal degree in co-relation 11852. Up to 2223 conditions per place. [2025-04-13 20:38:56,598 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 209 selfloop transitions, 157 changer transitions 4/370 dead transitions. [2025-04-13 20:38:56,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 370 transitions, 3359 flow [2025-04-13 20:38:56,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:38:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:38:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2025-04-13 20:38:56,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-04-13 20:38:56,600 INFO L175 Difference]: Start difference. First operand has 117 places, 250 transitions, 1860 flow. Second operand 14 states and 152 transitions. [2025-04-13 20:38:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 370 transitions, 3359 flow [2025-04-13 20:38:56,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 370 transitions, 3308 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:56,635 INFO L231 Difference]: Finished difference. Result has 139 places, 327 transitions, 3018 flow [2025-04-13 20:38:56,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3018, PETRI_PLACES=139, PETRI_TRANSITIONS=327} [2025-04-13 20:38:56,636 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2025-04-13 20:38:56,636 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 327 transitions, 3018 flow [2025-04-13 20:38:56,636 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-13 20:38:56,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:56,636 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-13 20:38:56,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:38:56,636 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-13 20:38:56,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1621419195, now seen corresponding path program 5 times [2025-04-13 20:38:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:56,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280695236] [2025-04-13 20:38:56,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:38:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:56,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:56,649 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:56,649 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:56,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:57,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280695236] [2025-04-13 20:38:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280695236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:57,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137429131] [2025-04-13 20:38:57,129 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:38:57,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:57,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:57,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:38:57,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:38:57,187 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:38:57,187 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:57,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:38:57,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:57,209 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-13 20:38:57,346 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 55 treesize of output 31 [2025-04-13 20:38:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:57,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:58,442 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 112 treesize of output 98 [2025-04-13 20:38:58,445 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 141 treesize of output 127 [2025-04-13 20:38:58,519 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 102 treesize of output 92 [2025-04-13 20:38:58,522 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 121 treesize of output 111 [2025-04-13 20:38:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137429131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:58,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:58,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-13 20:38:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602417785] [2025-04-13 20:38:58,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:58,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:38:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:58,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:38:58,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:38:58,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:58,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 327 transitions, 3018 flow. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:58,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:58,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:58,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:01,132 INFO L116 PetriNetUnfolderBase]: 2321/3480 cut-off events. [2025-04-13 20:39:01,132 INFO L117 PetriNetUnfolderBase]: For 16665/16665 co-relation queries the response was YES. [2025-04-13 20:39:01,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17152 conditions, 3480 events. 2321/3480 cut-off events. For 16665/16665 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 17433 event pairs, 72 based on Foata normal form. 2/3281 useless extension candidates. Maximal degree in co-relation 17006. Up to 1895 conditions per place. [2025-04-13 20:39:01,156 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 218 selfloop transitions, 346 changer transitions 5/569 dead transitions. [2025-04-13 20:39:01,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 569 transitions, 5912 flow [2025-04-13 20:39:01,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 20:39:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 20:39:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 339 transitions. [2025-04-13 20:39:01,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3026785714285714 [2025-04-13 20:39:01,158 INFO L175 Difference]: Start difference. First operand has 139 places, 327 transitions, 3018 flow. Second operand 35 states and 339 transitions. [2025-04-13 20:39:01,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 569 transitions, 5912 flow [2025-04-13 20:39:01,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 569 transitions, 5665 flow, removed 120 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:01,225 INFO L231 Difference]: Finished difference. Result has 186 places, 471 transitions, 5204 flow [2025-04-13 20:39:01,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5204, PETRI_PLACES=186, PETRI_TRANSITIONS=471} [2025-04-13 20:39:01,226 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2025-04-13 20:39:01,226 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 471 transitions, 5204 flow [2025-04-13 20:39:01,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:01,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:01,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-13 20:39:01,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:01,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 20:39:01,427 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-13 20:39:01,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1211397753, now seen corresponding path program 6 times [2025-04-13 20:39:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:01,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735011606] [2025-04-13 20:39:01,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:39:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:01,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:01,442 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:01,442 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:39:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:01,855 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-13 20:39:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:01,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735011606] [2025-04-13 20:39:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735011606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:01,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239432708] [2025-04-13 20:39:01,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:01,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:01,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:01,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:01,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:01,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:01,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 471 transitions, 5204 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-13 20:39:01,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:01,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:01,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:02,403 INFO L116 PetriNetUnfolderBase]: 2373/3579 cut-off events. [2025-04-13 20:39:02,403 INFO L117 PetriNetUnfolderBase]: For 21252/21252 co-relation queries the response was YES. [2025-04-13 20:39:02,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20487 conditions, 3579 events. 2373/3579 cut-off events. For 21252/21252 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18146 event pairs, 182 based on Foata normal form. 1/3379 useless extension candidates. Maximal degree in co-relation 20317. Up to 3249 conditions per place. [2025-04-13 20:39:02,427 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 389 selfloop transitions, 126 changer transitions 4/519 dead transitions. [2025-04-13 20:39:02,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 519 transitions, 6556 flow [2025-04-13 20:39:02,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-13 20:39:02,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-13 20:39:02,428 INFO L175 Difference]: Start difference. First operand has 186 places, 471 transitions, 5204 flow. Second operand 10 states and 110 transitions. [2025-04-13 20:39:02,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 519 transitions, 6556 flow [2025-04-13 20:39:02,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 519 transitions, 6029 flow, removed 208 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:02,584 INFO L231 Difference]: Finished difference. Result has 193 places, 491 transitions, 5166 flow [2025-04-13 20:39:02,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4695, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5166, PETRI_PLACES=193, PETRI_TRANSITIONS=491} [2025-04-13 20:39:02,586 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2025-04-13 20:39:02,586 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 491 transitions, 5166 flow [2025-04-13 20:39:02,586 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-13 20:39:02,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:02,586 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-13 20:39:02,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:39:02,586 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-13 20:39:02,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -745350263, now seen corresponding path program 7 times [2025-04-13 20:39:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:02,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791663629] [2025-04-13 20:39:02,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:02,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:02,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:02,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:02,965 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-13 20:39:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:02,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791663629] [2025-04-13 20:39:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791663629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11367208] [2025-04-13 20:39:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:02,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:02,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:02,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 491 transitions, 5166 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-13 20:39:02,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:02,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:03,597 INFO L116 PetriNetUnfolderBase]: 2419/3656 cut-off events. [2025-04-13 20:39:03,597 INFO L117 PetriNetUnfolderBase]: For 18812/18812 co-relation queries the response was YES. [2025-04-13 20:39:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20740 conditions, 3656 events. 2419/3656 cut-off events. For 18812/18812 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 18682 event pairs, 194 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 20559. Up to 3359 conditions per place. [2025-04-13 20:39:03,622 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 417 selfloop transitions, 126 changer transitions 5/548 dead transitions. [2025-04-13 20:39:03,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 548 transitions, 6693 flow [2025-04-13 20:39:03,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:39:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:39:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2025-04-13 20:39:03,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30528846153846156 [2025-04-13 20:39:03,624 INFO L175 Difference]: Start difference. First operand has 193 places, 491 transitions, 5166 flow. Second operand 13 states and 127 transitions. [2025-04-13 20:39:03,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 548 transitions, 6693 flow [2025-04-13 20:39:03,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 548 transitions, 6529 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:03,743 INFO L231 Difference]: Finished difference. Result has 205 places, 519 transitions, 5695 flow [2025-04-13 20:39:03,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5010, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5695, PETRI_PLACES=205, PETRI_TRANSITIONS=519} [2025-04-13 20:39:03,744 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2025-04-13 20:39:03,744 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 519 transitions, 5695 flow [2025-04-13 20:39:03,744 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-13 20:39:03,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:03,745 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-13 20:39:03,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:39:03,745 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-13 20:39:03,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -881493819, now seen corresponding path program 8 times [2025-04-13 20:39:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:03,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94149508] [2025-04-13 20:39:03,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:03,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:03,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:03,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:39:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:04,061 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-13 20:39:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:04,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94149508] [2025-04-13 20:39:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94149508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:04,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094445478] [2025-04-13 20:39:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:04,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:04,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:04,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:04,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:04,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 519 transitions, 5695 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-13 20:39:04,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:04,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:04,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:04,660 INFO L116 PetriNetUnfolderBase]: 2470/3749 cut-off events. [2025-04-13 20:39:04,660 INFO L117 PetriNetUnfolderBase]: For 21524/21524 co-relation queries the response was YES. [2025-04-13 20:39:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21948 conditions, 3749 events. 2470/3749 cut-off events. For 21524/21524 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 19352 event pairs, 189 based on Foata normal form. 1/3545 useless extension candidates. Maximal degree in co-relation 21744. Up to 3325 conditions per place. [2025-04-13 20:39:04,684 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 416 selfloop transitions, 150 changer transitions 4/570 dead transitions. [2025-04-13 20:39:04,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 570 transitions, 7184 flow [2025-04-13 20:39:04,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-13 20:39:04,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-13 20:39:04,685 INFO L175 Difference]: Start difference. First operand has 205 places, 519 transitions, 5695 flow. Second operand 10 states and 114 transitions. [2025-04-13 20:39:04,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 570 transitions, 7184 flow [2025-04-13 20:39:04,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 570 transitions, 7006 flow, removed 64 selfloop flow, removed 2 redundant places. [2025-04-13 20:39:04,821 INFO L231 Difference]: Finished difference. Result has 215 places, 536 transitions, 6090 flow [2025-04-13 20:39:04,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5517, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6090, PETRI_PLACES=215, PETRI_TRANSITIONS=536} [2025-04-13 20:39:04,822 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2025-04-13 20:39:04,822 INFO L485 AbstractCegarLoop]: Abstraction has has 215 places, 536 transitions, 6090 flow [2025-04-13 20:39:04,823 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-13 20:39:04,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:04,823 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-13 20:39:04,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:39:04,823 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-13 20:39:04,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -271961543, now seen corresponding path program 9 times [2025-04-13 20:39:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:04,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538003218] [2025-04-13 20:39:04,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:04,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:04,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:04,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:39:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:05,124 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-13 20:39:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:05,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538003218] [2025-04-13 20:39:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538003218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934303649] [2025-04-13 20:39:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:05,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:05,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:05,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:05,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 536 transitions, 6090 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-13 20:39:05,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:05,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:05,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:05,769 INFO L116 PetriNetUnfolderBase]: 2601/3960 cut-off events. [2025-04-13 20:39:05,769 INFO L117 PetriNetUnfolderBase]: For 24960/24960 co-relation queries the response was YES. [2025-04-13 20:39:05,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23879 conditions, 3960 events. 2601/3960 cut-off events. For 24960/24960 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 20769 event pairs, 220 based on Foata normal form. 1/3758 useless extension candidates. Maximal degree in co-relation 23649. Up to 3489 conditions per place. [2025-04-13 20:39:05,790 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 435 selfloop transitions, 166 changer transitions 5/606 dead transitions. [2025-04-13 20:39:05,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 606 transitions, 7921 flow [2025-04-13 20:39:05,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2025-04-13 20:39:05,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.365625 [2025-04-13 20:39:05,792 INFO L175 Difference]: Start difference. First operand has 215 places, 536 transitions, 6090 flow. Second operand 10 states and 117 transitions. [2025-04-13 20:39:05,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 606 transitions, 7921 flow [2025-04-13 20:39:05,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 606 transitions, 7713 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:05,954 INFO L231 Difference]: Finished difference. Result has 222 places, 568 transitions, 6717 flow [2025-04-13 20:39:05,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5882, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6717, PETRI_PLACES=222, PETRI_TRANSITIONS=568} [2025-04-13 20:39:05,955 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2025-04-13 20:39:05,955 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 568 transitions, 6717 flow [2025-04-13 20:39:05,956 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-13 20:39:05,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:05,956 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-13 20:39:05,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:39:05,956 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-13 20:39:05,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1722843817, now seen corresponding path program 10 times [2025-04-13 20:39:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:05,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364359086] [2025-04-13 20:39:05,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:05,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:05,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:05,969 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:06,195 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-13 20:39:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:06,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364359086] [2025-04-13 20:39:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364359086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:39:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010059457] [2025-04-13 20:39:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:06,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:39:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:06,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:39:06,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:39:06,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 568 transitions, 6717 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-13 20:39:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:06,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:06,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:06,901 INFO L116 PetriNetUnfolderBase]: 2653/4031 cut-off events. [2025-04-13 20:39:06,901 INFO L117 PetriNetUnfolderBase]: For 28940/28940 co-relation queries the response was YES. [2025-04-13 20:39:06,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25383 conditions, 4031 events. 2653/4031 cut-off events. For 28940/28940 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 21126 event pairs, 223 based on Foata normal form. 1/3837 useless extension candidates. Maximal degree in co-relation 25177. Up to 3631 conditions per place. [2025-04-13 20:39:06,932 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 441 selfloop transitions, 194 changer transitions 5/640 dead transitions. [2025-04-13 20:39:06,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 640 transitions, 8779 flow [2025-04-13 20:39:06,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:39:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:39:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-04-13 20:39:06,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2025-04-13 20:39:06,934 INFO L175 Difference]: Start difference. First operand has 222 places, 568 transitions, 6717 flow. Second operand 11 states and 130 transitions. [2025-04-13 20:39:06,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 640 transitions, 8779 flow [2025-04-13 20:39:07,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 640 transitions, 8420 flow, removed 98 selfloop flow, removed 6 redundant places. [2025-04-13 20:39:07,112 INFO L231 Difference]: Finished difference. Result has 230 places, 607 transitions, 7541 flow [2025-04-13 20:39:07,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6428, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7541, PETRI_PLACES=230, PETRI_TRANSITIONS=607} [2025-04-13 20:39:07,113 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2025-04-13 20:39:07,113 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 607 transitions, 7541 flow [2025-04-13 20:39:07,113 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-13 20:39:07,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:07,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-13 20:39:07,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:39:07,113 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-13 20:39:07,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 3905465, now seen corresponding path program 11 times [2025-04-13 20:39:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:07,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935743942] [2025-04-13 20:39:07,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:07,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:07,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:07,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:07,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:07,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935743942] [2025-04-13 20:39:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935743942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:07,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878651110] [2025-04-13 20:39:07,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:07,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:07,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:07,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:39:07,489 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:07,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:07,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:07,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:07,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:39:07,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:07,518 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-13 20:39:07,657 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:07,657 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 67 treesize of output 39 [2025-04-13 20:39:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:07,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:08,683 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 76 treesize of output 66 [2025-04-13 20:39:08,685 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 93 treesize of output 83 [2025-04-13 20:39:08,715 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 98 treesize of output 88 [2025-04-13 20:39:08,718 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 119 treesize of output 109 [2025-04-13 20:39:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878651110] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:08,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-13 20:39:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322171627] [2025-04-13 20:39:08,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:08,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:39:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:08,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:39:08,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:39:08,814 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:08,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 607 transitions, 7541 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:08,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:08,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:08,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:13,409 INFO L116 PetriNetUnfolderBase]: 4513/6774 cut-off events. [2025-04-13 20:39:13,409 INFO L117 PetriNetUnfolderBase]: For 55924/55924 co-relation queries the response was YES. [2025-04-13 20:39:13,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44965 conditions, 6774 events. 4513/6774 cut-off events. For 55924/55924 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 38596 event pairs, 98 based on Foata normal form. 1/6477 useless extension candidates. Maximal degree in co-relation 44707. Up to 3022 conditions per place. [2025-04-13 20:39:13,451 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 284 selfloop transitions, 1065 changer transitions 4/1353 dead transitions. [2025-04-13 20:39:13,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1353 transitions, 18483 flow [2025-04-13 20:39:13,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 20:39:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-13 20:39:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 635 transitions. [2025-04-13 20:39:13,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31005859375 [2025-04-13 20:39:13,453 INFO L175 Difference]: Start difference. First operand has 230 places, 607 transitions, 7541 flow. Second operand 64 states and 635 transitions. [2025-04-13 20:39:13,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1353 transitions, 18483 flow [2025-04-13 20:39:13,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1353 transitions, 17866 flow, removed 202 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:13,824 INFO L231 Difference]: Finished difference. Result has 306 places, 1202 transitions, 17657 flow [2025-04-13 20:39:13,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7066, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=517, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=17657, PETRI_PLACES=306, PETRI_TRANSITIONS=1202} [2025-04-13 20:39:13,825 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2025-04-13 20:39:13,825 INFO L485 AbstractCegarLoop]: Abstraction has has 306 places, 1202 transitions, 17657 flow [2025-04-13 20:39:13,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:13,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:13,825 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-13 20:39:13,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:14,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:14,026 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-13 20:39:14,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash -293806475, now seen corresponding path program 12 times [2025-04-13 20:39:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:14,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260446857] [2025-04-13 20:39:14,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:39:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:14,032 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:14,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:14,036 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:39:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:14,295 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-13 20:39:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:14,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260446857] [2025-04-13 20:39:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260446857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394402086] [2025-04-13 20:39:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:14,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:14,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:14,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:14,296 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:14,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 1202 transitions, 17657 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-13 20:39:14,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:14,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:15,731 INFO L116 PetriNetUnfolderBase]: 4506/6771 cut-off events. [2025-04-13 20:39:15,731 INFO L117 PetriNetUnfolderBase]: For 74365/74365 co-relation queries the response was YES. [2025-04-13 20:39:15,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52693 conditions, 6771 events. 4506/6771 cut-off events. For 74365/74365 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 38576 event pairs, 323 based on Foata normal form. 1/6480 useless extension candidates. Maximal degree in co-relation 52409. Up to 6384 conditions per place. [2025-04-13 20:39:15,796 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 1034 selfloop transitions, 194 changer transitions 4/1232 dead transitions. [2025-04-13 20:39:15,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1232 transitions, 20395 flow [2025-04-13 20:39:15,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-04-13 20:39:15,797 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.353125 [2025-04-13 20:39:15,797 INFO L175 Difference]: Start difference. First operand has 306 places, 1202 transitions, 17657 flow. Second operand 10 states and 113 transitions. [2025-04-13 20:39:15,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1232 transitions, 20395 flow [2025-04-13 20:39:16,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 1232 transitions, 17807 flow, removed 1237 selfloop flow, removed 7 redundant places. [2025-04-13 20:39:16,947 INFO L231 Difference]: Finished difference. Result has 311 places, 1211 transitions, 15662 flow [2025-04-13 20:39:16,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15097, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15662, PETRI_PLACES=311, PETRI_TRANSITIONS=1211} [2025-04-13 20:39:16,948 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 280 predicate places. [2025-04-13 20:39:16,948 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 1211 transitions, 15662 flow [2025-04-13 20:39:16,948 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-13 20:39:16,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:16,948 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-13 20:39:16,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:39:16,949 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-13 20:39:16,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1498034283, now seen corresponding path program 13 times [2025-04-13 20:39:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:16,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459973088] [2025-04-13 20:39:16,949 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:16,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:16,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:16,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:16,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:17,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459973088] [2025-04-13 20:39:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459973088] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:17,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967191576] [2025-04-13 20:39:17,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:17,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:17,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:39:17,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:17,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:39:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:17,439 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-13 20:39:17,568 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 55 treesize of output 31 [2025-04-13 20:39:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:17,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:18,573 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 102 treesize of output 92 [2025-04-13 20:39:18,575 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 121 treesize of output 111 [2025-04-13 20:39:18,650 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 112 treesize of output 98 [2025-04-13 20:39:18,654 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 141 treesize of output 127 [2025-04-13 20:39:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967191576] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:18,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:39:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008327807] [2025-04-13 20:39:18,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:18,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:39:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:18,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:39:18,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:39:18,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:18,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1211 transitions, 15662 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-13 20:39:18,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:18,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:18,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:22,130 INFO L116 PetriNetUnfolderBase]: 5926/8845 cut-off events. [2025-04-13 20:39:22,131 INFO L117 PetriNetUnfolderBase]: For 53311/53311 co-relation queries the response was YES. [2025-04-13 20:39:22,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58564 conditions, 8845 events. 5926/8845 cut-off events. For 53311/53311 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 52325 event pairs, 211 based on Foata normal form. 7/8446 useless extension candidates. Maximal degree in co-relation 58280. Up to 5980 conditions per place. [2025-04-13 20:39:22,203 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 943 selfloop transitions, 788 changer transitions 1/1732 dead transitions. [2025-04-13 20:39:22,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1732 transitions, 24608 flow [2025-04-13 20:39:22,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:39:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:39:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 424 transitions. [2025-04-13 20:39:22,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3231707317073171 [2025-04-13 20:39:22,204 INFO L175 Difference]: Start difference. First operand has 311 places, 1211 transitions, 15662 flow. Second operand 41 states and 424 transitions. [2025-04-13 20:39:22,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1732 transitions, 24608 flow [2025-04-13 20:39:22,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1732 transitions, 24177 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-04-13 20:39:22,817 INFO L231 Difference]: Finished difference. Result has 364 places, 1579 transitions, 22685 flow [2025-04-13 20:39:22,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15001, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=22685, PETRI_PLACES=364, PETRI_TRANSITIONS=1579} [2025-04-13 20:39:22,818 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 333 predicate places. [2025-04-13 20:39:22,818 INFO L485 AbstractCegarLoop]: Abstraction has has 364 places, 1579 transitions, 22685 flow [2025-04-13 20:39:22,818 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-13 20:39:22,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:22,818 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-13 20:39:22,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:39:23,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:39:23,019 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-13 20:39:23,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -767294839, now seen corresponding path program 14 times [2025-04-13 20:39:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:23,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556090468] [2025-04-13 20:39:23,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:23,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:23,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:23,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:39:23,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:23,294 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-13 20:39:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:23,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556090468] [2025-04-13 20:39:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556090468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:23,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713331607] [2025-04-13 20:39:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:23,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:23,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:23,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:23,295 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:23,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1579 transitions, 22685 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-13 20:39:23,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:23,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:23,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:25,211 INFO L116 PetriNetUnfolderBase]: 5979/8942 cut-off events. [2025-04-13 20:39:25,211 INFO L117 PetriNetUnfolderBase]: For 69176/69176 co-relation queries the response was YES. [2025-04-13 20:39:25,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66240 conditions, 8942 events. 5979/8942 cut-off events. For 69176/69176 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 53155 event pairs, 401 based on Foata normal form. 2/8534 useless extension candidates. Maximal degree in co-relation 65934. Up to 8584 conditions per place. [2025-04-13 20:39:25,282 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1462 selfloop transitions, 160 changer transitions 5/1627 dead transitions. [2025-04-13 20:39:25,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1627 transitions, 26396 flow [2025-04-13 20:39:25,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:39:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:39:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2025-04-13 20:39:25,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.296875 [2025-04-13 20:39:25,283 INFO L175 Difference]: Start difference. First operand has 364 places, 1579 transitions, 22685 flow. Second operand 12 states and 114 transitions. [2025-04-13 20:39:25,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1627 transitions, 26396 flow [2025-04-13 20:39:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1627 transitions, 25512 flow, removed 277 selfloop flow, removed 9 redundant places. [2025-04-13 20:39:26,293 INFO L231 Difference]: Finished difference. Result has 372 places, 1602 transitions, 22641 flow [2025-04-13 20:39:26,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21807, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22641, PETRI_PLACES=372, PETRI_TRANSITIONS=1602} [2025-04-13 20:39:26,295 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 341 predicate places. [2025-04-13 20:39:26,295 INFO L485 AbstractCegarLoop]: Abstraction has has 372 places, 1602 transitions, 22641 flow [2025-04-13 20:39:26,295 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-13 20:39:26,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:26,295 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-13 20:39:26,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:39:26,295 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-13 20:39:26,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1852173935, now seen corresponding path program 15 times [2025-04-13 20:39:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:26,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399179885] [2025-04-13 20:39:26,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:26,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:26,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:26,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:39:26,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:26,555 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-13 20:39:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:26,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399179885] [2025-04-13 20:39:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399179885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19320789] [2025-04-13 20:39:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:26,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:26,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:26,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:26,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:26,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1602 transitions, 22641 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-13 20:39:26,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:26,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:26,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:28,426 INFO L116 PetriNetUnfolderBase]: 6007/9004 cut-off events. [2025-04-13 20:39:28,426 INFO L117 PetriNetUnfolderBase]: For 66401/66401 co-relation queries the response was YES. [2025-04-13 20:39:28,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65840 conditions, 9004 events. 6007/9004 cut-off events. For 66401/66401 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 53851 event pairs, 409 based on Foata normal form. 2/8592 useless extension candidates. Maximal degree in co-relation 65586. Up to 8612 conditions per place. [2025-04-13 20:39:28,641 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1482 selfloop transitions, 157 changer transitions 1/1640 dead transitions. [2025-04-13 20:39:28,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1640 transitions, 26274 flow [2025-04-13 20:39:28,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-13 20:39:28,642 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.321875 [2025-04-13 20:39:28,642 INFO L175 Difference]: Start difference. First operand has 372 places, 1602 transitions, 22641 flow. Second operand 10 states and 103 transitions. [2025-04-13 20:39:28,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1640 transitions, 26274 flow [2025-04-13 20:39:29,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1640 transitions, 26135 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-13 20:39:29,505 INFO L231 Difference]: Finished difference. Result has 380 places, 1611 transitions, 23005 flow [2025-04-13 20:39:29,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22502, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23005, PETRI_PLACES=380, PETRI_TRANSITIONS=1611} [2025-04-13 20:39:29,507 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 349 predicate places. [2025-04-13 20:39:29,507 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 1611 transitions, 23005 flow [2025-04-13 20:39:29,507 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-13 20:39:29,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:29,507 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-13 20:39:29,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:39:29,507 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-13 20:39:29,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2075030257, now seen corresponding path program 16 times [2025-04-13 20:39:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:29,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181120303] [2025-04-13 20:39:29,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:29,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:29,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:29,515 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:29,825 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-13 20:39:29,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:29,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181120303] [2025-04-13 20:39:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181120303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337488338] [2025-04-13 20:39:29,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:29,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:29,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:29,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:29,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:29,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1611 transitions, 23005 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-13 20:39:29,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:29,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:29,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:32,212 INFO L116 PetriNetUnfolderBase]: 6194/9291 cut-off events. [2025-04-13 20:39:32,213 INFO L117 PetriNetUnfolderBase]: For 70096/70096 co-relation queries the response was YES. [2025-04-13 20:39:32,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68322 conditions, 9291 events. 6194/9291 cut-off events. For 70096/70096 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 55973 event pairs, 290 based on Foata normal form. 2/8859 useless extension candidates. Maximal degree in co-relation 68066. Up to 7163 conditions per place. [2025-04-13 20:39:32,313 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1092 selfloop transitions, 652 changer transitions 7/1751 dead transitions. [2025-04-13 20:39:32,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1751 transitions, 28161 flow [2025-04-13 20:39:32,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:39:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:39:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2025-04-13 20:39:32,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2025-04-13 20:39:32,314 INFO L175 Difference]: Start difference. First operand has 380 places, 1611 transitions, 23005 flow. Second operand 14 states and 162 transitions. [2025-04-13 20:39:32,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1751 transitions, 28161 flow [2025-04-13 20:39:33,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1751 transitions, 27852 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-04-13 20:39:33,492 INFO L231 Difference]: Finished difference. Result has 393 places, 1680 transitions, 25977 flow [2025-04-13 20:39:33,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22712, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=588, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=25977, PETRI_PLACES=393, PETRI_TRANSITIONS=1680} [2025-04-13 20:39:33,493 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 362 predicate places. [2025-04-13 20:39:33,493 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 1680 transitions, 25977 flow [2025-04-13 20:39:33,493 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-13 20:39:33,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:33,493 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-13 20:39:33,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:39:33,493 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-13 20:39:33,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2120792729, now seen corresponding path program 17 times [2025-04-13 20:39:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:33,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062839319] [2025-04-13 20:39:33,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:33,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:39:33,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:39:33,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:33,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:33,531 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-13 20:39:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:33,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062839319] [2025-04-13 20:39:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062839319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:33,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010936727] [2025-04-13 20:39:33,532 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:33,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:33,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:33,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:39:33,574 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:39:33,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:39:33,589 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:33,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:33,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:39:33,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:33,625 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-13 20:39:33,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:33,657 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-13 20:39:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010936727] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:33,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:39:33,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 20:39:33,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725860500] [2025-04-13 20:39:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:33,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:39:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:33,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:39:33,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:33,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:33,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1680 transitions, 25977 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-13 20:39:33,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:33,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:36,134 INFO L116 PetriNetUnfolderBase]: 7488/11103 cut-off events. [2025-04-13 20:39:36,134 INFO L117 PetriNetUnfolderBase]: For 107070/107070 co-relation queries the response was YES. [2025-04-13 20:39:36,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85391 conditions, 11103 events. 7488/11103 cut-off events. For 107070/107070 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 66788 event pairs, 1706 based on Foata normal form. 196/10861 useless extension candidates. Maximal degree in co-relation 85094. Up to 6040 conditions per place. [2025-04-13 20:39:36,245 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1986 selfloop transitions, 106 changer transitions 0/2092 dead transitions. [2025-04-13 20:39:36,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2092 transitions, 35758 flow [2025-04-13 20:39:36,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:39:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:39:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-13 20:39:36,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-13 20:39:36,246 INFO L175 Difference]: Start difference. First operand has 393 places, 1680 transitions, 25977 flow. Second operand 6 states and 87 transitions. [2025-04-13 20:39:36,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 2092 transitions, 35758 flow [2025-04-13 20:39:38,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2092 transitions, 35409 flow, removed 85 selfloop flow, removed 4 redundant places. [2025-04-13 20:39:38,028 INFO L231 Difference]: Finished difference. Result has 395 places, 1660 transitions, 25801 flow [2025-04-13 20:39:38,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24547, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=25801, PETRI_PLACES=395, PETRI_TRANSITIONS=1660} [2025-04-13 20:39:38,030 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 364 predicate places. [2025-04-13 20:39:38,030 INFO L485 AbstractCegarLoop]: Abstraction has has 395 places, 1660 transitions, 25801 flow [2025-04-13 20:39:38,030 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-13 20:39:38,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:38,030 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-13 20:39:38,037 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-13 20:39:38,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:38,231 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-13 20:39:38,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -540109826, now seen corresponding path program 1 times [2025-04-13 20:39:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:38,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369253784] [2025-04-13 20:39:38,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:38,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:38,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:38,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:38,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369253784] [2025-04-13 20:39:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369253784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:38,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737615344] [2025-04-13 20:39:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:38,269 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-13 20:39:38,270 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-13 20:39:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:38,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:38,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:38,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:38,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:39:38,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:38,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737615344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:38,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 20:39:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345060454] [2025-04-13 20:39:38,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:38,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:38,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:38,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:38,372 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:38,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1660 transitions, 25801 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-13 20:39:38,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:38,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:38,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:39,973 INFO L116 PetriNetUnfolderBase]: 4728/7131 cut-off events. [2025-04-13 20:39:39,973 INFO L117 PetriNetUnfolderBase]: For 83004/83004 co-relation queries the response was YES. [2025-04-13 20:39:40,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56051 conditions, 7131 events. 4728/7131 cut-off events. For 83004/83004 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 40870 event pairs, 1127 based on Foata normal form. 214/7131 useless extension candidates. Maximal degree in co-relation 55766. Up to 4046 conditions per place. [2025-04-13 20:39:40,043 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1266 selfloop transitions, 26 changer transitions 6/1298 dead transitions. [2025-04-13 20:39:40,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1298 transitions, 22206 flow [2025-04-13 20:39:40,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:39:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:39:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 20:39:40,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 20:39:40,044 INFO L175 Difference]: Start difference. First operand has 395 places, 1660 transitions, 25801 flow. Second operand 6 states and 82 transitions. [2025-04-13 20:39:40,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1298 transitions, 22206 flow [2025-04-13 20:39:40,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1298 transitions, 20852 flow, removed 304 selfloop flow, removed 24 redundant places. [2025-04-13 20:39:40,810 INFO L231 Difference]: Finished difference. Result has 351 places, 1113 transitions, 16147 flow [2025-04-13 20:39:40,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15978, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1081, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16147, PETRI_PLACES=351, PETRI_TRANSITIONS=1113} [2025-04-13 20:39:40,811 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 320 predicate places. [2025-04-13 20:39:40,811 INFO L485 AbstractCegarLoop]: Abstraction has has 351 places, 1113 transitions, 16147 flow [2025-04-13 20:39:40,811 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-13 20:39:40,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:40,811 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-13 20:39:40,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:41,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:41,012 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-13 20:39:41,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1018846234, now seen corresponding path program 1 times [2025-04-13 20:39:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:41,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982269416] [2025-04-13 20:39:41,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:41,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:41,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:41,049 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-13 20:39:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:41,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982269416] [2025-04-13 20:39:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982269416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:41,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685119470] [2025-04-13 20:39:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:41,051 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-13 20:39:41,054 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-13 20:39:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:41,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:41,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:39:41,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:41,168 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-13 20:39:41,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:41,207 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-13 20:39:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685119470] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:41,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:39:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446488906] [2025-04-13 20:39:41,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:41,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:39:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:41,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:39:41,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:41,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:41,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1113 transitions, 16147 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:41,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:41,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:41,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:42,469 INFO L116 PetriNetUnfolderBase]: 4173/6336 cut-off events. [2025-04-13 20:39:42,469 INFO L117 PetriNetUnfolderBase]: For 60443/60443 co-relation queries the response was YES. [2025-04-13 20:39:42,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48540 conditions, 6336 events. 4173/6336 cut-off events. For 60443/60443 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 35924 event pairs, 1107 based on Foata normal form. 143/6299 useless extension candidates. Maximal degree in co-relation 48375. Up to 5198 conditions per place. [2025-04-13 20:39:42,533 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1039 selfloop transitions, 43 changer transitions 47/1129 dead transitions. [2025-04-13 20:39:42,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1129 transitions, 18525 flow [2025-04-13 20:39:42,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:39:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:39:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-04-13 20:39:42,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:39:42,534 INFO L175 Difference]: Start difference. First operand has 351 places, 1113 transitions, 16147 flow. Second operand 6 states and 74 transitions. [2025-04-13 20:39:42,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1129 transitions, 18525 flow [2025-04-13 20:39:43,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 1129 transitions, 18425 flow, removed 27 selfloop flow, removed 11 redundant places. [2025-04-13 20:39:43,044 INFO L231 Difference]: Finished difference. Result has 341 places, 1039 transitions, 15224 flow [2025-04-13 20:39:43,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15526, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1068, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15224, PETRI_PLACES=341, PETRI_TRANSITIONS=1039} [2025-04-13 20:39:43,045 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 310 predicate places. [2025-04-13 20:39:43,045 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 1039 transitions, 15224 flow [2025-04-13 20:39:43,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:43,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:43,045 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-13 20:39:43,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:39:43,249 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-13 20:39:43,249 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-13 20:39:43,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -330545160, now seen corresponding path program 1 times [2025-04-13 20:39:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:43,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768011133] [2025-04-13 20:39:43,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:43,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:43,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:43,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:43,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:43,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768011133] [2025-04-13 20:39:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768011133] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:43,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090392346] [2025-04-13 20:39:43,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:43,289 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-13 20:39:43,291 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-13 20:39:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:39:43,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:39:43,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:43,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:43,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:39:43,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:43,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090392346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:43,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:39:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185552400] [2025-04-13 20:39:43,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:43,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:39:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:39:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:43,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:43,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1039 transitions, 15224 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:43,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:43,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:43,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:44,314 INFO L116 PetriNetUnfolderBase]: 3749/5585 cut-off events. [2025-04-13 20:39:44,314 INFO L117 PetriNetUnfolderBase]: For 51291/51291 co-relation queries the response was YES. [2025-04-13 20:39:44,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43683 conditions, 5585 events. 3749/5585 cut-off events. For 51291/51291 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 29582 event pairs, 993 based on Foata normal form. 86/5513 useless extension candidates. Maximal degree in co-relation 43572. Up to 5198 conditions per place. [2025-04-13 20:39:44,365 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 893 selfloop transitions, 3 changer transitions 107/1003 dead transitions. [2025-04-13 20:39:44,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1003 transitions, 16645 flow [2025-04-13 20:39:44,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:39:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:39:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-13 20:39:44,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-04-13 20:39:44,366 INFO L175 Difference]: Start difference. First operand has 341 places, 1039 transitions, 15224 flow. Second operand 6 states and 69 transitions. [2025-04-13 20:39:44,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1003 transitions, 16645 flow [2025-04-13 20:39:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1003 transitions, 16126 flow, removed 89 selfloop flow, removed 16 redundant places. [2025-04-13 20:39:44,779 INFO L231 Difference]: Finished difference. Result has 321 places, 896 transitions, 12404 flow [2025-04-13 20:39:44,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14040, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12404, PETRI_PLACES=321, PETRI_TRANSITIONS=896} [2025-04-13 20:39:44,780 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 290 predicate places. [2025-04-13 20:39:44,780 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 896 transitions, 12404 flow [2025-04-13 20:39:44,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:44,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:44,780 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-13 20:39:44,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:44,981 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,SelfDestructingSolverStorable22 [2025-04-13 20:39:44,981 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-13 20:39:44,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1957440060, now seen corresponding path program 2 times [2025-04-13 20:39:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:44,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698914410] [2025-04-13 20:39:44,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:44,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:44,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:44,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:45,017 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-13 20:39:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:45,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698914410] [2025-04-13 20:39:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698914410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:45,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018868488] [2025-04-13 20:39:45,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:45,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:45,019 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-13 20:39:45,021 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-13 20:39:45,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:45,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:45,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:45,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:39:45,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:45,128 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-13 20:39:45,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:45,166 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-13 20:39:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018868488] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:45,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:39:45,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:39:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993348364] [2025-04-13 20:39:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:45,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:39:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:45,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:39:45,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:45,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:45,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 896 transitions, 12404 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-13 20:39:45,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:45,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:45,865 INFO L116 PetriNetUnfolderBase]: 3567/5188 cut-off events. [2025-04-13 20:39:45,865 INFO L117 PetriNetUnfolderBase]: For 41744/41744 co-relation queries the response was YES. [2025-04-13 20:39:45,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39150 conditions, 5188 events. 3567/5188 cut-off events. For 41744/41744 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 26325 event pairs, 721 based on Foata normal form. 48/5082 useless extension candidates. Maximal degree in co-relation 39052. Up to 4045 conditions per place. [2025-04-13 20:39:45,909 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 926 selfloop transitions, 56 changer transitions 0/982 dead transitions. [2025-04-13 20:39:45,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 982 transitions, 15492 flow [2025-04-13 20:39:45,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:39:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:39:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-13 20:39:45,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-13 20:39:45,910 INFO L175 Difference]: Start difference. First operand has 321 places, 896 transitions, 12404 flow. Second operand 7 states and 74 transitions. [2025-04-13 20:39:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 982 transitions, 15492 flow [2025-04-13 20:39:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 982 transitions, 14841 flow, removed 105 selfloop flow, removed 21 redundant places. [2025-04-13 20:39:46,310 INFO L231 Difference]: Finished difference. Result has 288 places, 892 transitions, 12026 flow [2025-04-13 20:39:46,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11625, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12026, PETRI_PLACES=288, PETRI_TRANSITIONS=892} [2025-04-13 20:39:46,311 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2025-04-13 20:39:46,311 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 892 transitions, 12026 flow [2025-04-13 20:39:46,311 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-13 20:39:46,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:46,311 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-13 20:39:46,317 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-13 20:39:46,512 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,SelfDestructingSolverStorable23 [2025-04-13 20:39:46,512 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-13 20:39:46,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2117937042, now seen corresponding path program 3 times [2025-04-13 20:39:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:46,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517420435] [2025-04-13 20:39:46,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:46,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:46,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:46,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:46,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:46,550 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-13 20:39:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:46,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517420435] [2025-04-13 20:39:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517420435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:46,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849907795] [2025-04-13 20:39:46,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:46,552 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-13 20:39:46,554 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-13 20:39:46,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:46,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:46,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:46,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:46,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:39:46,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:46,639 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-13 20:39:46,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:46,676 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-13 20:39:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849907795] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:39:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:39:46,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726746942] [2025-04-13 20:39:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:46,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:39:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:46,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:39:46,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:46,677 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:46,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 892 transitions, 12026 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-13 20:39:46,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:46,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:46,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:47,363 INFO L116 PetriNetUnfolderBase]: 3653/5321 cut-off events. [2025-04-13 20:39:47,363 INFO L117 PetriNetUnfolderBase]: For 43468/43468 co-relation queries the response was YES. [2025-04-13 20:39:47,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39205 conditions, 5321 events. 3653/5321 cut-off events. For 43468/43468 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 27116 event pairs, 347 based on Foata normal form. 35/5202 useless extension candidates. Maximal degree in co-relation 39116. Up to 3913 conditions per place. [2025-04-13 20:39:47,408 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 865 selfloop transitions, 131 changer transitions 0/996 dead transitions. [2025-04-13 20:39:47,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 996 transitions, 15389 flow [2025-04-13 20:39:47,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:39:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:39:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-13 20:39:47,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-13 20:39:47,409 INFO L175 Difference]: Start difference. First operand has 288 places, 892 transitions, 12026 flow. Second operand 7 states and 78 transitions. [2025-04-13 20:39:47,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 996 transitions, 15389 flow [2025-04-13 20:39:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 996 transitions, 15296 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:47,755 INFO L231 Difference]: Finished difference. Result has 291 places, 926 transitions, 13067 flow [2025-04-13 20:39:47,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11913, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13067, PETRI_PLACES=291, PETRI_TRANSITIONS=926} [2025-04-13 20:39:47,756 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2025-04-13 20:39:47,756 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 926 transitions, 13067 flow [2025-04-13 20:39:47,756 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-13 20:39:47,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:47,756 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-13 20:39:47,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:47,956 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,SelfDestructingSolverStorable24 [2025-04-13 20:39:47,957 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-13 20:39:47,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1055187348, now seen corresponding path program 4 times [2025-04-13 20:39:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:47,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537641916] [2025-04-13 20:39:47,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:47,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:47,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:39:47,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:39:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:47,981 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-13 20:39:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:47,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537641916] [2025-04-13 20:39:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537641916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:47,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258100557] [2025-04-13 20:39:47,981 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:47,983 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-13 20:39:47,984 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-13 20:39:48,019 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:48,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:39:48,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:39:48,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:48,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:39:48,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:48,052 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-13 20:39:48,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:48,072 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-13 20:39:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258100557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:48,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-13 20:39:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732456398] [2025-04-13 20:39:48,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:48,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:39:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:48,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:39:48,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:39:48,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:48,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 926 transitions, 13067 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-13 20:39:48,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:48,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:48,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:49,143 INFO L116 PetriNetUnfolderBase]: 4713/6809 cut-off events. [2025-04-13 20:39:49,143 INFO L117 PetriNetUnfolderBase]: For 56257/56257 co-relation queries the response was YES. [2025-04-13 20:39:49,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50412 conditions, 6809 events. 4713/6809 cut-off events. For 56257/56257 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 35766 event pairs, 131 based on Foata normal form. 8/6603 useless extension candidates. Maximal degree in co-relation 50321. Up to 3428 conditions per place. [2025-04-13 20:39:49,205 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1183 selfloop transitions, 377 changer transitions 0/1560 dead transitions. [2025-04-13 20:39:49,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1560 transitions, 24482 flow [2025-04-13 20:39:49,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:39:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:39:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2025-04-13 20:39:49,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4735576923076923 [2025-04-13 20:39:49,206 INFO L175 Difference]: Start difference. First operand has 291 places, 926 transitions, 13067 flow. Second operand 13 states and 197 transitions. [2025-04-13 20:39:49,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 1560 transitions, 24482 flow [2025-04-13 20:39:49,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 1560 transitions, 24329 flow, removed 61 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:49,629 INFO L231 Difference]: Finished difference. Result has 305 places, 1110 transitions, 17019 flow [2025-04-13 20:39:49,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12990, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17019, PETRI_PLACES=305, PETRI_TRANSITIONS=1110} [2025-04-13 20:39:49,629 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2025-04-13 20:39:49,629 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 1110 transitions, 17019 flow [2025-04-13 20:39:49,630 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-13 20:39:49,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:49,630 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-13 20:39:49,635 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-13 20:39:49,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:39:49,830 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-13 20:39:49,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 923124468, now seen corresponding path program 5 times [2025-04-13 20:39:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:49,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700777786] [2025-04-13 20:39:49,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:49,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:49,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:49,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:49,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:49,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:49,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700777786] [2025-04-13 20:39:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700777786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:49,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565547650] [2025-04-13 20:39:49,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:49,869 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-13 20:39:49,870 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-13 20:39:49,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:49,920 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:49,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:49,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:49,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:39:49,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:49,955 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-13 20:39:49,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:49,983 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-13 20:39:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565547650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:49,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:39:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388735073] [2025-04-13 20:39:49,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:49,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:39:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:39:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:39:49,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:49,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1110 transitions, 17019 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:49,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:49,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:49,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:51,542 INFO L116 PetriNetUnfolderBase]: 6087/8743 cut-off events. [2025-04-13 20:39:51,542 INFO L117 PetriNetUnfolderBase]: For 89548/89548 co-relation queries the response was YES. [2025-04-13 20:39:51,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66265 conditions, 8743 events. 6087/8743 cut-off events. For 89548/89548 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 46502 event pairs, 219 based on Foata normal form. 66/8533 useless extension candidates. Maximal degree in co-relation 66169. Up to 4431 conditions per place. [2025-04-13 20:39:51,740 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1047 selfloop transitions, 542 changer transitions 0/1589 dead transitions. [2025-04-13 20:39:51,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1589 transitions, 26615 flow [2025-04-13 20:39:51,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:39:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:39:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 197 transitions. [2025-04-13 20:39:51,741 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.384765625 [2025-04-13 20:39:51,741 INFO L175 Difference]: Start difference. First operand has 305 places, 1110 transitions, 17019 flow. Second operand 16 states and 197 transitions. [2025-04-13 20:39:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 1589 transitions, 26615 flow [2025-04-13 20:39:52,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 1589 transitions, 26165 flow, removed 149 selfloop flow, removed 4 redundant places. [2025-04-13 20:39:52,472 INFO L231 Difference]: Finished difference. Result has 318 places, 1231 transitions, 20293 flow [2025-04-13 20:39:52,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=16354, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=20293, PETRI_PLACES=318, PETRI_TRANSITIONS=1231} [2025-04-13 20:39:52,473 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2025-04-13 20:39:52,473 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 1231 transitions, 20293 flow [2025-04-13 20:39:52,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:52,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:52,473 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-13 20:39:52,479 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-13 20:39:52,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:39:52,674 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-13 20:39:52,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1240495483, now seen corresponding path program 1 times [2025-04-13 20:39:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:52,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776502134] [2025-04-13 20:39:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:52,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:39:52,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:39:52,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:53,680 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-13 20:39:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:53,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776502134] [2025-04-13 20:39:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776502134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:53,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746353507] [2025-04-13 20:39:53,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:53,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:53,682 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-13 20:39:53,683 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-13 20:39:53,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:39:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:39:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:53,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:39:53,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:53,779 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-13 20:39:54,262 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:54,262 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 140 treesize of output 72 [2025-04-13 20:39:54,379 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-13 20:39:54,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:57,077 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 187 treesize of output 163 [2025-04-13 20:39:57,082 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:57,082 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 257 treesize of output 209 [2025-04-13 20:39:57,232 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 342 treesize of output 304 [2025-04-13 20:39:57,238 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:57,238 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 413 treesize of output 349 [2025-04-13 20:39:57,499 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-13 20:39:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746353507] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:57,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2025-04-13 20:39:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432809490] [2025-04-13 20:39:57,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:57,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:39:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:57,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:39:57,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:39:57,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:57,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 1231 transitions, 20293 flow. Second operand has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:57,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:57,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:57,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:02,827 INFO L116 PetriNetUnfolderBase]: 7153/10342 cut-off events. [2025-04-13 20:40:02,827 INFO L117 PetriNetUnfolderBase]: For 109431/109431 co-relation queries the response was YES. [2025-04-13 20:40:02,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79577 conditions, 10342 events. 7153/10342 cut-off events. For 109431/109431 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 57118 event pairs, 492 based on Foata normal form. 3/10001 useless extension candidates. Maximal degree in co-relation 79477. Up to 8653 conditions per place. [2025-04-13 20:40:02,927 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1212 selfloop transitions, 419 changer transitions 6/1637 dead transitions. [2025-04-13 20:40:02,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1637 transitions, 28846 flow [2025-04-13 20:40:02,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 20:40:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 20:40:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 372 transitions. [2025-04-13 20:40:02,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-04-13 20:40:02,929 INFO L175 Difference]: Start difference. First operand has 318 places, 1231 transitions, 20293 flow. Second operand 36 states and 372 transitions. [2025-04-13 20:40:02,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1637 transitions, 28846 flow [2025-04-13 20:40:04,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 1637 transitions, 28395 flow, removed 216 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:04,125 INFO L231 Difference]: Finished difference. Result has 360 places, 1450 transitions, 24406 flow [2025-04-13 20:40:04,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19937, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=24406, PETRI_PLACES=360, PETRI_TRANSITIONS=1450} [2025-04-13 20:40:04,125 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 329 predicate places. [2025-04-13 20:40:04,126 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 1450 transitions, 24406 flow [2025-04-13 20:40:04,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:04,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:04,126 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-13 20:40:04,132 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-13 20:40:04,326 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,SelfDestructingSolverStorable27 [2025-04-13 20:40:04,326 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-13 20:40:04,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1520497967, now seen corresponding path program 2 times [2025-04-13 20:40:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:04,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882461391] [2025-04-13 20:40:04,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:04,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:04,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:04,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:04,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:04,907 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-13 20:40:04,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:04,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882461391] [2025-04-13 20:40:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882461391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:04,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484681617] [2025-04-13 20:40:04,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:04,909 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-13 20:40:04,910 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-13 20:40:04,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:04,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:04,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:04,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:04,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:40:04,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:05,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:40:05,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:40:05,363 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:05,364 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 174 treesize of output 82 [2025-04-13 20:40:05,677 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-13 20:40:05,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:06,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:06,877 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 326 treesize of output 174 [2025-04-13 20:40:07,454 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-13 20:40:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484681617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:07,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:40:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704677560] [2025-04-13 20:40:07,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:07,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:40:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:40:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:40:07,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:07,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1450 transitions, 24406 flow. Second operand has 31 states, 31 states have (on average 4.774193548387097) internal successors, (148), 31 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:07,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:07,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:07,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:13,315 INFO L116 PetriNetUnfolderBase]: 8652/12532 cut-off events. [2025-04-13 20:40:13,316 INFO L117 PetriNetUnfolderBase]: For 146093/146093 co-relation queries the response was YES. [2025-04-13 20:40:13,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100450 conditions, 12532 events. 8652/12532 cut-off events. For 146093/146093 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 71631 event pairs, 413 based on Foata normal form. 3/12101 useless extension candidates. Maximal degree in co-relation 100339. Up to 9060 conditions per place. [2025-04-13 20:40:13,415 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1211 selfloop transitions, 727 changer transitions 13/1951 dead transitions. [2025-04-13 20:40:13,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1951 transitions, 35051 flow [2025-04-13 20:40:13,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:40:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:40:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 443 transitions. [2025-04-13 20:40:13,416 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32194767441860467 [2025-04-13 20:40:13,416 INFO L175 Difference]: Start difference. First operand has 360 places, 1450 transitions, 24406 flow. Second operand 43 states and 443 transitions. [2025-04-13 20:40:13,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 1951 transitions, 35051 flow [2025-04-13 20:40:14,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1951 transitions, 33836 flow, removed 565 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:14,923 INFO L231 Difference]: Finished difference. Result has 411 places, 1700 transitions, 29324 flow [2025-04-13 20:40:14,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23375, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=29324, PETRI_PLACES=411, PETRI_TRANSITIONS=1700} [2025-04-13 20:40:14,924 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 380 predicate places. [2025-04-13 20:40:14,924 INFO L485 AbstractCegarLoop]: Abstraction has has 411 places, 1700 transitions, 29324 flow [2025-04-13 20:40:14,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.774193548387097) internal successors, (148), 31 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:14,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:14,925 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-13 20:40:14,932 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-13 20:40:15,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:15,125 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-13 20:40:15,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2100741089, now seen corresponding path program 3 times [2025-04-13 20:40:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:15,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967361681] [2025-04-13 20:40:15,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:15,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:15,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:15,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:15,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:15,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:15,749 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-13 20:40:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:15,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967361681] [2025-04-13 20:40:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967361681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:15,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647196773] [2025-04-13 20:40:15,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:15,751 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-13 20:40:15,752 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-13 20:40:15,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:15,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:15,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:15,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:40:15,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:16,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:40:16,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:40:16,182 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:16,183 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 153 treesize of output 73 [2025-04-13 20:40:16,495 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-13 20:40:16,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:17,693 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:17,694 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 326 treesize of output 174 [2025-04-13 20:40:18,238 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-13 20:40:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647196773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:18,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:40:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370279607] [2025-04-13 20:40:18,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:18,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:40:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:18,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:40:18,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:40:18,239 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:18,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 1700 transitions, 29324 flow. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:18,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:18,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:26,499 INFO L116 PetriNetUnfolderBase]: 9265/13565 cut-off events. [2025-04-13 20:40:26,499 INFO L117 PetriNetUnfolderBase]: For 174133/174133 co-relation queries the response was YES. [2025-04-13 20:40:26,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114776 conditions, 13565 events. 9265/13565 cut-off events. For 174133/174133 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 80113 event pairs, 443 based on Foata normal form. 3/13161 useless extension candidates. Maximal degree in co-relation 114650. Up to 9528 conditions per place. [2025-04-13 20:40:26,635 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1245 selfloop transitions, 971 changer transitions 15/2231 dead transitions. [2025-04-13 20:40:26,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 2231 transitions, 41204 flow [2025-04-13 20:40:26,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 20:40:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-13 20:40:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 572 transitions. [2025-04-13 20:40:26,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31919642857142855 [2025-04-13 20:40:26,637 INFO L175 Difference]: Start difference. First operand has 411 places, 1700 transitions, 29324 flow. Second operand 56 states and 572 transitions. [2025-04-13 20:40:26,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 2231 transitions, 41204 flow [2025-04-13 20:40:29,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 2231 transitions, 39701 flow, removed 509 selfloop flow, removed 12 redundant places. [2025-04-13 20:40:29,141 INFO L231 Difference]: Finished difference. Result has 477 places, 1960 transitions, 35219 flow [2025-04-13 20:40:29,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28008, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=746, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=35219, PETRI_PLACES=477, PETRI_TRANSITIONS=1960} [2025-04-13 20:40:29,143 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 446 predicate places. [2025-04-13 20:40:29,144 INFO L485 AbstractCegarLoop]: Abstraction has has 477 places, 1960 transitions, 35219 flow [2025-04-13 20:40:29,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:29,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:29,144 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-13 20:40:29,153 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-13 20:40:29,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:29,345 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-13 20:40:29,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1147451221, now seen corresponding path program 4 times [2025-04-13 20:40:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:29,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052684656] [2025-04-13 20:40:29,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:29,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:29,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:29,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:29,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:29,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:29,916 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-13 20:40:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:29,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052684656] [2025-04-13 20:40:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052684656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:29,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254991917] [2025-04-13 20:40:29,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:29,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:29,918 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-13 20:40:29,919 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-13 20:40:29,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:29,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:29,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:29,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:29,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:40:29,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:30,570 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:30,570 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 136 treesize of output 72 [2025-04-13 20:40:30,701 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-13 20:40:30,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:31,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:31,806 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 340 treesize of output 164 [2025-04-13 20:40:32,222 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-13 20:40:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254991917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:32,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 33 [2025-04-13 20:40:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72992627] [2025-04-13 20:40:32,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:32,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:40:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:32,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:40:32,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:40:32,224 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:32,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 1960 transitions, 35219 flow. Second operand has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:32,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:39,604 INFO L116 PetriNetUnfolderBase]: 9886/14475 cut-off events. [2025-04-13 20:40:39,604 INFO L117 PetriNetUnfolderBase]: For 212446/212446 co-relation queries the response was YES. [2025-04-13 20:40:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128445 conditions, 14475 events. 9886/14475 cut-off events. For 212446/212446 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 86563 event pairs, 539 based on Foata normal form. 2/14337 useless extension candidates. Maximal degree in co-relation 128296. Up to 12657 conditions per place. [2025-04-13 20:40:39,753 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1710 selfloop transitions, 500 changer transitions 6/2216 dead transitions. [2025-04-13 20:40:39,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 2216 transitions, 42789 flow [2025-04-13 20:40:39,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:40:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:40:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 390 transitions. [2025-04-13 20:40:39,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3207236842105263 [2025-04-13 20:40:39,755 INFO L175 Difference]: Start difference. First operand has 477 places, 1960 transitions, 35219 flow. Second operand 38 states and 390 transitions. [2025-04-13 20:40:39,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 2216 transitions, 42789 flow [2025-04-13 20:40:42,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 2216 transitions, 41182 flow, removed 652 selfloop flow, removed 10 redundant places. [2025-04-13 20:40:42,818 INFO L231 Difference]: Finished difference. Result has 513 places, 2076 transitions, 36852 flow [2025-04-13 20:40:42,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33828, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=36852, PETRI_PLACES=513, PETRI_TRANSITIONS=2076} [2025-04-13 20:40:42,820 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 482 predicate places. [2025-04-13 20:40:42,820 INFO L485 AbstractCegarLoop]: Abstraction has has 513 places, 2076 transitions, 36852 flow [2025-04-13 20:40:42,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:42,820 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-13 20:40:42,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:40:43,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:43,021 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-13 20:40:43,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -472032863, now seen corresponding path program 5 times [2025-04-13 20:40:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:43,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895984509] [2025-04-13 20:40:43,021 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:43,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:43,032 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:43,032 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:43,929 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-13 20:40:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:43,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895984509] [2025-04-13 20:40:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895984509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:43,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473374380] [2025-04-13 20:40:43,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:43,931 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-13 20:40:43,932 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-13 20:40:43,972 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:40:43,985 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:40:43,986 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:43,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:40:43,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:44,433 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:40:44,433 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 156 treesize of output 80 [2025-04-13 20:40:44,650 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-13 20:40:44,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:45,850 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:45,850 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 619 treesize of output 303 [2025-04-13 20:40:47,563 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-13 20:40:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473374380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:47,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 20:40:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896756236] [2025-04-13 20:40:47,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:47,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:40:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:47,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:40:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:40:47,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:47,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 2076 transitions, 36852 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-13 20:40:47,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:47,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:47,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:56,119 INFO L116 PetriNetUnfolderBase]: 10244/15011 cut-off events. [2025-04-13 20:40:56,119 INFO L117 PetriNetUnfolderBase]: For 224381/224381 co-relation queries the response was YES. [2025-04-13 20:40:56,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134690 conditions, 15011 events. 10244/15011 cut-off events. For 224381/224381 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 90270 event pairs, 474 based on Foata normal form. 2/14844 useless extension candidates. Maximal degree in co-relation 134537. Up to 12488 conditions per place. [2025-04-13 20:40:56,315 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1718 selfloop transitions, 615 changer transitions 6/2339 dead transitions. [2025-04-13 20:40:56,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 2339 transitions, 45004 flow [2025-04-13 20:40:56,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:40:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:40:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 428 transitions. [2025-04-13 20:40:56,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2025-04-13 20:40:56,316 INFO L175 Difference]: Start difference. First operand has 513 places, 2076 transitions, 36852 flow. Second operand 42 states and 428 transitions. [2025-04-13 20:40:56,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 2339 transitions, 45004 flow [2025-04-13 20:40:59,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 2339 transitions, 43842 flow, removed 458 selfloop flow, removed 8 redundant places. [2025-04-13 20:40:59,845 INFO L231 Difference]: Finished difference. Result has 556 places, 2153 transitions, 38517 flow [2025-04-13 20:40:59,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35702, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=551, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=38517, PETRI_PLACES=556, PETRI_TRANSITIONS=2153} [2025-04-13 20:40:59,846 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 525 predicate places. [2025-04-13 20:40:59,846 INFO L485 AbstractCegarLoop]: Abstraction has has 556 places, 2153 transitions, 38517 flow [2025-04-13 20:40:59,847 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-13 20:40:59,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:59,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:59,853 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-13 20:41:00,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:00,047 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-13 20:41:00,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1750607697, now seen corresponding path program 1 times [2025-04-13 20:41:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:00,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882643832] [2025-04-13 20:41:00,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:00,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:00,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:00,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:00,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:00,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882643832] [2025-04-13 20:41:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882643832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:00,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665057403] [2025-04-13 20:41:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:00,796 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-13 20:41:00,797 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-13 20:41:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:00,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:00,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:00,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:00,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:41:00,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:00,892 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 19 treesize of output 1 [2025-04-13 20:41:01,474 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:01,475 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 163 treesize of output 77 [2025-04-13 20:41:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:01,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:07,386 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 374 treesize of output 332 [2025-04-13 20:41:07,393 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:07,393 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 486 treesize of output 404 [2025-04-13 20:41:07,740 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 202 treesize of output 176 [2025-04-13 20:41:07,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:07,749 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 274 treesize of output 1 [2025-04-13 20:41:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:07,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665057403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:07,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:07,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2025-04-13 20:41:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580309509] [2025-04-13 20:41:07,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:07,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:41:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:07,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:41:07,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:41:07,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:07,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 2153 transitions, 38517 flow. Second operand has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:07,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:07,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:18,725 INFO L116 PetriNetUnfolderBase]: 10622/15574 cut-off events. [2025-04-13 20:41:18,726 INFO L117 PetriNetUnfolderBase]: For 236083/236083 co-relation queries the response was YES. [2025-04-13 20:41:18,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142052 conditions, 15574 events. 10622/15574 cut-off events. For 236083/236083 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 94210 event pairs, 528 based on Foata normal form. 1/15340 useless extension candidates. Maximal degree in co-relation 141890. Up to 12498 conditions per place. [2025-04-13 20:41:18,907 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1627 selfloop transitions, 795 changer transitions 3/2425 dead transitions. [2025-04-13 20:41:18,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 2425 transitions, 47265 flow [2025-04-13 20:41:18,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:41:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:41:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 444 transitions. [2025-04-13 20:41:18,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3016304347826087 [2025-04-13 20:41:18,909 INFO L175 Difference]: Start difference. First operand has 556 places, 2153 transitions, 38517 flow. Second operand 46 states and 444 transitions. [2025-04-13 20:41:18,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 2425 transitions, 47265 flow [2025-04-13 20:41:22,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 2425 transitions, 46059 flow, removed 277 selfloop flow, removed 17 redundant places. [2025-04-13 20:41:22,714 INFO L231 Difference]: Finished difference. Result has 593 places, 2242 transitions, 41042 flow [2025-04-13 20:41:22,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37338, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=717, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=41042, PETRI_PLACES=593, PETRI_TRANSITIONS=2242} [2025-04-13 20:41:22,715 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 562 predicate places. [2025-04-13 20:41:22,715 INFO L485 AbstractCegarLoop]: Abstraction has has 593 places, 2242 transitions, 41042 flow [2025-04-13 20:41:22,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:22,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:22,716 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-13 20:41:22,722 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-13 20:41:22,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:22,916 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-13 20:41:22,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash -84596793, now seen corresponding path program 6 times [2025-04-13 20:41:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:22,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195809641] [2025-04-13 20:41:22,918 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:22,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:22,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:22,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:41:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:23,642 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-13 20:41:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:23,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195809641] [2025-04-13 20:41:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195809641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:23,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949992276] [2025-04-13 20:41:23,643 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:23,645 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-13 20:41:23,645 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-13 20:41:23,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:23,699 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:23,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:41:23,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:23,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:41:23,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:24,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:24,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:24,123 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:24,123 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 157 treesize of output 77 [2025-04-13 20:41:24,400 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-13 20:41:24,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:25,585 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:25,585 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 302 treesize of output 162 [2025-04-13 20:41:25,993 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-13 20:41:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949992276] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:25,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 20:41:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245261042] [2025-04-13 20:41:25,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:25,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:41:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:25,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:41:25,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:41:25,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:25,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 2242 transitions, 41042 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-13 20:41:25,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:25,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:25,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:34,609 INFO L116 PetriNetUnfolderBase]: 11004/16133 cut-off events. [2025-04-13 20:41:34,609 INFO L117 PetriNetUnfolderBase]: For 261530/261530 co-relation queries the response was YES. [2025-04-13 20:41:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151469 conditions, 16133 events. 11004/16133 cut-off events. For 261530/261530 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 97778 event pairs, 497 based on Foata normal form. 2/15885 useless extension candidates. Maximal degree in co-relation 151298. Up to 11798 conditions per place. [2025-04-13 20:41:34,797 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1615 selfloop transitions, 976 changer transitions 9/2600 dead transitions. [2025-04-13 20:41:34,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 2600 transitions, 51502 flow [2025-04-13 20:41:34,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 20:41:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-13 20:41:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 488 transitions. [2025-04-13 20:41:34,798 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.324468085106383 [2025-04-13 20:41:34,798 INFO L175 Difference]: Start difference. First operand has 593 places, 2242 transitions, 41042 flow. Second operand 47 states and 488 transitions. [2025-04-13 20:41:34,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 2600 transitions, 51502 flow [2025-04-13 20:41:38,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 2600 transitions, 50313 flow, removed 474 selfloop flow, removed 11 redundant places. [2025-04-13 20:41:38,697 INFO L231 Difference]: Finished difference. Result has 634 places, 2363 transitions, 45178 flow [2025-04-13 20:41:38,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=39892, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=862, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=45178, PETRI_PLACES=634, PETRI_TRANSITIONS=2363} [2025-04-13 20:41:38,699 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 603 predicate places. [2025-04-13 20:41:38,699 INFO L485 AbstractCegarLoop]: Abstraction has has 634 places, 2363 transitions, 45178 flow [2025-04-13 20:41:38,699 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-13 20:41:38,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:38,699 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-13 20:41:38,706 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-13 20:41:38,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:38,900 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-13 20:41:38,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1282063953, now seen corresponding path program 7 times [2025-04-13 20:41:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:38,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724897989] [2025-04-13 20:41:38,901 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:38,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:38,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:38,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:39,623 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-13 20:41:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:39,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724897989] [2025-04-13 20:41:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724897989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:39,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564967006] [2025-04-13 20:41:39,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:39,625 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-13 20:41:39,626 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-13 20:41:39,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:39,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:39,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:39,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:39,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:41:39,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:39,724 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-13 20:41:40,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:40,085 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:40,085 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 142 treesize of output 80 [2025-04-13 20:41:40,350 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-13 20:41:40,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:43,029 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 187 treesize of output 163 [2025-04-13 20:41:43,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:43,035 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 257 treesize of output 209 [2025-04-13 20:41:43,210 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 338 treesize of output 300 [2025-04-13 20:41:43,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:43,217 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 409 treesize of output 349 [2025-04-13 20:41:43,595 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-13 20:41:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564967006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:43,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2025-04-13 20:41:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129312054] [2025-04-13 20:41:43,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:43,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:41:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:43,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:41:43,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:41:43,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:43,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 2363 transitions, 45178 flow. Second operand has 36 states, 36 states have (on average 4.75) internal successors, (171), 36 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:43,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:43,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:43,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:56,185 INFO L116 PetriNetUnfolderBase]: 12419/18149 cut-off events. [2025-04-13 20:41:56,185 INFO L117 PetriNetUnfolderBase]: For 340825/340825 co-relation queries the response was YES. [2025-04-13 20:41:56,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179360 conditions, 18149 events. 12419/18149 cut-off events. For 340825/340825 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 111241 event pairs, 410 based on Foata normal form. 4/17867 useless extension candidates. Maximal degree in co-relation 179184. Up to 13389 conditions per place. [2025-04-13 20:41:56,405 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1851 selfloop transitions, 999 changer transitions 9/2859 dead transitions. [2025-04-13 20:41:56,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 2859 transitions, 59106 flow [2025-04-13 20:41:56,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:41:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:41:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 616 transitions. [2025-04-13 20:41:56,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32083333333333336 [2025-04-13 20:41:56,407 INFO L175 Difference]: Start difference. First operand has 634 places, 2363 transitions, 45178 flow. Second operand 60 states and 616 transitions. [2025-04-13 20:41:56,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 2859 transitions, 59106 flow [2025-04-13 20:42:01,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 2859 transitions, 57460 flow, removed 550 selfloop flow, removed 12 redundant places. [2025-04-13 20:42:01,073 INFO L231 Difference]: Finished difference. Result has 700 places, 2639 transitions, 52192 flow [2025-04-13 20:42:01,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43662, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=767, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=52192, PETRI_PLACES=700, PETRI_TRANSITIONS=2639} [2025-04-13 20:42:01,074 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 669 predicate places. [2025-04-13 20:42:01,075 INFO L485 AbstractCegarLoop]: Abstraction has has 700 places, 2639 transitions, 52192 flow [2025-04-13 20:42:01,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.75) internal successors, (171), 36 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:01,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:01,075 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-13 20:42:01,081 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-13 20:42:01,275 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,SelfDestructingSolverStorable34 [2025-04-13 20:42:01,275 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-13 20:42:01,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1447143663, now seen corresponding path program 8 times [2025-04-13 20:42:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:01,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905597247] [2025-04-13 20:42:01,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:01,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:01,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:01,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:01,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,934 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-13 20:42:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:01,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905597247] [2025-04-13 20:42:01,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905597247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:01,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301510329] [2025-04-13 20:42:01,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:01,936 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-13 20:42:01,937 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-13 20:42:01,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:01,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:01,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:42:01,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:02,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:02,507 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:02,507 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 157 treesize of output 77 [2025-04-13 20:42:02,696 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-13 20:42:02,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:03,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:03,972 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 302 treesize of output 162 [2025-04-13 20:42:04,486 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-13 20:42:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301510329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:04,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:42:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117772748] [2025-04-13 20:42:04,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:04,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:42:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:42:04,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:42:04,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:04,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 2639 transitions, 52192 flow. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:04,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:04,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:13,845 INFO L116 PetriNetUnfolderBase]: 12491/18283 cut-off events. [2025-04-13 20:42:13,845 INFO L117 PetriNetUnfolderBase]: For 373106/373106 co-relation queries the response was YES. [2025-04-13 20:42:14,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187713 conditions, 18283 events. 12491/18283 cut-off events. For 373106/373106 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 112271 event pairs, 489 based on Foata normal form. 3/17908 useless extension candidates. Maximal degree in co-relation 187518. Up to 14104 conditions per place. [2025-04-13 20:42:14,084 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1943 selfloop transitions, 902 changer transitions 10/2855 dead transitions. [2025-04-13 20:42:14,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 2855 transitions, 60588 flow [2025-04-13 20:42:14,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 20:42:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 20:42:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 364 transitions. [2025-04-13 20:42:14,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33455882352941174 [2025-04-13 20:42:14,086 INFO L175 Difference]: Start difference. First operand has 700 places, 2639 transitions, 52192 flow. Second operand 34 states and 364 transitions. [2025-04-13 20:42:14,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 2855 transitions, 60588 flow [2025-04-13 20:42:20,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 2855 transitions, 57725 flow, removed 1153 selfloop flow, removed 15 redundant places. [2025-04-13 20:42:20,499 INFO L231 Difference]: Finished difference. Result has 722 places, 2666 transitions, 51811 flow [2025-04-13 20:42:20,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49349, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=878, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=51811, PETRI_PLACES=722, PETRI_TRANSITIONS=2666} [2025-04-13 20:42:20,502 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 691 predicate places. [2025-04-13 20:42:20,502 INFO L485 AbstractCegarLoop]: Abstraction has has 722 places, 2666 transitions, 51811 flow [2025-04-13 20:42:20,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:20,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:20,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:20,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:42:20,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 20:42:20,703 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-13 20:42:20,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash 758360977, now seen corresponding path program 2 times [2025-04-13 20:42:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:20,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69387847] [2025-04-13 20:42:20,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:20,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:20,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:20,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:20,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:21,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69387847] [2025-04-13 20:42:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69387847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:21,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842174390] [2025-04-13 20:42:21,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:21,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:21,595 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-13 20:42:21,596 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-13 20:42:21,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:21,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:21,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:21,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:21,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:42:21,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:22,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:22,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:22,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:22,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:22,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:22,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 95 [2025-04-13 20:42:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:22,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:23,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:23,936 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 395 treesize of output 166 [2025-04-13 20:42:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842174390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:24,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 38 [2025-04-13 20:42:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196625983] [2025-04-13 20:42:24,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:24,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 20:42:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 20:42:24,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 20:42:24,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:24,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 2666 transitions, 51811 flow. Second operand has 40 states, 40 states have (on average 4.825) internal successors, (193), 40 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:24,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:24,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:24,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:52,661 INFO L116 PetriNetUnfolderBase]: 21077/31058 cut-off events. [2025-04-13 20:42:52,662 INFO L117 PetriNetUnfolderBase]: For 697613/697613 co-relation queries the response was YES. [2025-04-13 20:42:53,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316109 conditions, 31058 events. 21077/31058 cut-off events. For 697613/697613 co-relation queries the response was YES. Maximal size of possible extension queue 1636. Compared 208649 event pairs, 472 based on Foata normal form. 7/30455 useless extension candidates. Maximal degree in co-relation 315909. Up to 14953 conditions per place. [2025-04-13 20:42:53,287 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1886 selfloop transitions, 3119 changer transitions 24/5029 dead transitions. [2025-04-13 20:42:53,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 5029 transitions, 103755 flow [2025-04-13 20:42:53,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-04-13 20:42:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2025-04-13 20:42:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 1420 transitions. [2025-04-13 20:42:53,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3192446043165468 [2025-04-13 20:42:53,290 INFO L175 Difference]: Start difference. First operand has 722 places, 2666 transitions, 51811 flow. Second operand 139 states and 1420 transitions. [2025-04-13 20:42:53,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 5029 transitions, 103755 flow [2025-04-13 20:43:05,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 5029 transitions, 102191 flow, removed 193 selfloop flow, removed 11 redundant places. [2025-04-13 20:43:05,847 INFO L231 Difference]: Finished difference. Result has 891 places, 4276 transitions, 94465 flow [2025-04-13 20:43:05,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50433, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1748, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=139, PETRI_FLOW=94465, PETRI_PLACES=891, PETRI_TRANSITIONS=4276} [2025-04-13 20:43:05,849 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 860 predicate places. [2025-04-13 20:43:05,849 INFO L485 AbstractCegarLoop]: Abstraction has has 891 places, 4276 transitions, 94465 flow [2025-04-13 20:43:05,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.825) internal successors, (193), 40 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:05,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:05,849 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-13 20:43:05,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:43:06,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:43:06,050 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-13 20:43:06,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash 747868637, now seen corresponding path program 9 times [2025-04-13 20:43:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:06,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245354376] [2025-04-13 20:43:06,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:06,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:06,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:06,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:06,837 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-13 20:43:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:06,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245354376] [2025-04-13 20:43:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245354376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:06,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190634097] [2025-04-13 20:43:06,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:06,839 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-13 20:43:06,840 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-13 20:43:06,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:06,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:06,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:06,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:43:06,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:07,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:07,320 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 137 treesize of output 79 [2025-04-13 20:43:07,828 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-13 20:43:07,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:09,003 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:09,003 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 330 treesize of output 174 [2025-04-13 20:43:09,489 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-13 20:43:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190634097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:09,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 31 [2025-04-13 20:43:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159113152] [2025-04-13 20:43:09,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:09,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:43:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:09,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:43:09,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:43:09,491 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:09,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 4276 transitions, 94465 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-13 20:43:09,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:09,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:09,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:33,684 INFO L116 PetriNetUnfolderBase]: 21625/31868 cut-off events. [2025-04-13 20:43:33,685 INFO L117 PetriNetUnfolderBase]: For 875550/875550 co-relation queries the response was YES. [2025-04-13 20:43:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354274 conditions, 31868 events. 21625/31868 cut-off events. For 875550/875550 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 214880 event pairs, 1008 based on Foata normal form. 3/31270 useless extension candidates. Maximal degree in co-relation 354031. Up to 26281 conditions per place. [2025-04-13 20:43:35,135 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3215 selfloop transitions, 1554 changer transitions 13/4782 dead transitions. [2025-04-13 20:43:35,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 4782 transitions, 113163 flow [2025-04-13 20:43:35,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:43:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:43:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 608 transitions. [2025-04-13 20:43:35,136 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-04-13 20:43:35,136 INFO L175 Difference]: Start difference. First operand has 891 places, 4276 transitions, 94465 flow. Second operand 60 states and 608 transitions. [2025-04-13 20:43:35,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 4782 transitions, 113163 flow [2025-04-13 20:44:01,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 4782 transitions, 103296 flow, removed 4575 selfloop flow, removed 21 redundant places. [2025-04-13 20:44:01,223 INFO L231 Difference]: Finished difference. Result has 945 places, 4551 transitions, 96102 flow [2025-04-13 20:44:01,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=85554, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=96102, PETRI_PLACES=945, PETRI_TRANSITIONS=4551} [2025-04-13 20:44:01,227 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 914 predicate places. [2025-04-13 20:44:01,227 INFO L485 AbstractCegarLoop]: Abstraction has has 945 places, 4551 transitions, 96102 flow [2025-04-13 20:44:01,227 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-13 20:44:01,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:01,227 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-13 20:44:01,235 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-13 20:44:01,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:01,428 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-13 20:44:01,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash -393664015, now seen corresponding path program 10 times [2025-04-13 20:44:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:01,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176322565] [2025-04-13 20:44:01,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:01,434 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:01,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:01,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:02,296 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-13 20:44:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:02,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176322565] [2025-04-13 20:44:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176322565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:02,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742155702] [2025-04-13 20:44:02,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:02,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:02,298 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-13 20:44:02,299 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-13 20:44:02,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:02,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:02,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:02,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:02,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:44:02,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:02,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:02,884 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 142 treesize of output 88 [2025-04-13 20:44:03,466 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-13 20:44:03,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:04,460 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:04,461 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 350 treesize of output 164 [2025-04-13 20:44:04,854 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-13 20:44:04,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742155702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:04,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:04,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 33 [2025-04-13 20:44:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179962031] [2025-04-13 20:44:04,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:04,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:44:04,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:04,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:44:04,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:44:04,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:04,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 4551 transitions, 96102 flow. Second operand has 35 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:04,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:04,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:04,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:29,081 INFO L116 PetriNetUnfolderBase]: 22295/32837 cut-off events. [2025-04-13 20:44:29,081 INFO L117 PetriNetUnfolderBase]: For 808672/808672 co-relation queries the response was YES. [2025-04-13 20:44:29,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354955 conditions, 32837 events. 22295/32837 cut-off events. For 808672/808672 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 222383 event pairs, 1259 based on Foata normal form. 2/32231 useless extension candidates. Maximal degree in co-relation 354698. Up to 30758 conditions per place. [2025-04-13 20:44:30,138 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 4071 selfloop transitions, 796 changer transitions 6/4873 dead transitions. [2025-04-13 20:44:30,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 4873 transitions, 111579 flow [2025-04-13 20:44:30,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:44:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:44:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 413 transitions. [2025-04-13 20:44:30,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32265625 [2025-04-13 20:44:30,139 INFO L175 Difference]: Start difference. First operand has 945 places, 4551 transitions, 96102 flow. Second operand 40 states and 413 transitions. [2025-04-13 20:44:30,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 4873 transitions, 111579 flow [2025-04-13 20:44:50,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 4873 transitions, 108971 flow, removed 724 selfloop flow, removed 17 redundant places. [2025-04-13 20:44:50,776 INFO L231 Difference]: Finished difference. Result has 984 places, 4760 transitions, 100844 flow [2025-04-13 20:44:50,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93527, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=626, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=100844, PETRI_PLACES=984, PETRI_TRANSITIONS=4760} [2025-04-13 20:44:50,780 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 953 predicate places. [2025-04-13 20:44:50,780 INFO L485 AbstractCegarLoop]: Abstraction has has 984 places, 4760 transitions, 100844 flow [2025-04-13 20:44:50,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:50,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:50,781 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-13 20:44:50,788 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-13 20:44:50,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:44:50,981 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-13 20:44:50,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash 501725601, now seen corresponding path program 11 times [2025-04-13 20:44:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:50,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697778652] [2025-04-13 20:44:50,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:44:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:50,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:50,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:51,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:51,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:51,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697778652] [2025-04-13 20:44:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697778652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:51,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600068600] [2025-04-13 20:44:51,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:44:51,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:51,970 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-13 20:44:51,970 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-13 20:44:52,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:52,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:52,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:52,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:44:52,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:52,417 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:44:52,417 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 164 treesize of output 80 [2025-04-13 20:44:52,676 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-13 20:44:52,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:53,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:53,957 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 527 treesize of output 263 [2025-04-13 20:44:55,258 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-13 20:44:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600068600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:55,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:55,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 20:44:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89090773] [2025-04-13 20:44:55,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:55,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:44:55,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:44:55,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:44:55,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:55,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 4760 transitions, 100844 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-13 20:44:55,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:55,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:55,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:25,765 INFO L116 PetriNetUnfolderBase]: 23478/34563 cut-off events. [2025-04-13 20:45:25,765 INFO L117 PetriNetUnfolderBase]: For 937642/937642 co-relation queries the response was YES. [2025-04-13 20:45:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385714 conditions, 34563 events. 23478/34563 cut-off events. For 937642/937642 co-relation queries the response was YES. Maximal size of possible extension queue 1797. Compared 235419 event pairs, 1679 based on Foata normal form. 5/33927 useless extension candidates. Maximal degree in co-relation 385442. Up to 30675 conditions per place. [2025-04-13 20:45:27,587 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 4108 selfloop transitions, 1263 changer transitions 10/5381 dead transitions. [2025-04-13 20:45:27,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 5381 transitions, 123481 flow [2025-04-13 20:45:27,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 20:45:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 20:45:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 634 transitions. [2025-04-13 20:45:27,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31955645161290325 [2025-04-13 20:45:27,588 INFO L175 Difference]: Start difference. First operand has 984 places, 4760 transitions, 100844 flow. Second operand 62 states and 634 transitions. [2025-04-13 20:45:27,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 5381 transitions, 123481 flow [2025-04-13 20:45:53,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 5381 transitions, 121590 flow, removed 749 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:53,221 INFO L231 Difference]: Finished difference. Result has 1058 places, 5194 transitions, 113064 flow [2025-04-13 20:45:53,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=99086, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=910, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=113064, PETRI_PLACES=1058, PETRI_TRANSITIONS=5194} [2025-04-13 20:45:53,225 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1027 predicate places. [2025-04-13 20:45:53,225 INFO L485 AbstractCegarLoop]: Abstraction has has 1058 places, 5194 transitions, 113064 flow [2025-04-13 20:45:53,226 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-13 20:45:53,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:53,226 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-13 20:45:53,232 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-13 20:45:53,426 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,SelfDestructingSolverStorable39 [2025-04-13 20:45:53,426 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-13 20:45:53,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash -86737399, now seen corresponding path program 12 times [2025-04-13 20:45:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:53,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652019029] [2025-04-13 20:45:53,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:53,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:45:53,446 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:53,447 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:54,193 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-13 20:45:54,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:54,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652019029] [2025-04-13 20:45:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652019029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:54,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739063752] [2025-04-13 20:45:54,194 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:54,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:54,196 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-13 20:45:54,196 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-13 20:45:54,242 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:45:54,256 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:54,256 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:54,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:45:54,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:54,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:45:54,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:54,867 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 164 treesize of output 80 [2025-04-13 20:45:55,051 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-13 20:45:55,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:56,567 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:56,568 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 330 treesize of output 174 [2025-04-13 20:45:57,260 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-13 20:45:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739063752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:57,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 20:45:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959772615] [2025-04-13 20:45:57,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:57,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:45:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:45:57,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:45:57,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:57,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1058 places, 5194 transitions, 113064 flow. Second operand has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:57,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:57,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:57,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:28,900 INFO L116 PetriNetUnfolderBase]: 24210/35577 cut-off events. [2025-04-13 20:46:28,901 INFO L117 PetriNetUnfolderBase]: For 1035030/1035030 co-relation queries the response was YES. [2025-04-13 20:46:30,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410418 conditions, 35577 events. 24210/35577 cut-off events. For 1035030/1035030 co-relation queries the response was YES. Maximal size of possible extension queue 1846. Compared 242532 event pairs, 1709 based on Foata normal form. 3/34899 useless extension candidates. Maximal degree in co-relation 410125. Up to 30767 conditions per place. [2025-04-13 20:46:30,860 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 4192 selfloop transitions, 1491 changer transitions 10/5693 dead transitions. [2025-04-13 20:46:30,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 5693 transitions, 135964 flow [2025-04-13 20:46:30,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:46:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:46:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 519 transitions. [2025-04-13 20:46:30,861 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.337890625 [2025-04-13 20:46:30,861 INFO L175 Difference]: Start difference. First operand has 1058 places, 5194 transitions, 113064 flow. Second operand 48 states and 519 transitions. [2025-04-13 20:46:30,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 5693 transitions, 135964 flow [2025-04-13 20:46:59,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1088 places, 5693 transitions, 130054 flow, removed 2578 selfloop flow, removed 17 redundant places. [2025-04-13 20:46:59,930 INFO L231 Difference]: Finished difference. Result has 1104 places, 5507 transitions, 121353 flow [2025-04-13 20:46:59,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=108172, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=121353, PETRI_PLACES=1104, PETRI_TRANSITIONS=5507} [2025-04-13 20:46:59,934 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1073 predicate places. [2025-04-13 20:46:59,934 INFO L485 AbstractCegarLoop]: Abstraction has has 1104 places, 5507 transitions, 121353 flow [2025-04-13 20:46:59,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:59,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:59,935 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-13 20:46:59,941 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-13 20:47:00,135 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,SelfDestructingSolverStorable40 [2025-04-13 20:47:00,135 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-13 20:47:00,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1963535993, now seen corresponding path program 13 times [2025-04-13 20:47:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:00,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223710621] [2025-04-13 20:47:00,136 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:47:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:00,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:47:00,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:00,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:00,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:01,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223710621] [2025-04-13 20:47:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223710621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:01,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975313366] [2025-04-13 20:47:01,068 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:47:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:01,070 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-13 20:47:01,070 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-13 20:47:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:47:01,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:01,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:01,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:01,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:47:01,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:01,171 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 19 treesize of output 1 [2025-04-13 20:47:01,553 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:47:01,553 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 156 treesize of output 80 [2025-04-13 20:47:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:01,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:05,122 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 342 treesize of output 304 [2025-04-13 20:47:05,127 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:05,127 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 413 treesize of output 349 [2025-04-13 20:47:05,489 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 187 treesize of output 163 [2025-04-13 20:47:05,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:05,496 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 257 treesize of output 1 [2025-04-13 20:47:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975313366] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:05,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 37 [2025-04-13 20:47:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086426150] [2025-04-13 20:47:05,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:05,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:47:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:05,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:47:05,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:47:05,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:47:05,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 5507 transitions, 121353 flow. Second operand has 39 states, 39 states have (on average 4.923076923076923) internal successors, (192), 39 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:05,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:05,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:47:05,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:45,710 INFO L116 PetriNetUnfolderBase]: 25226/37051 cut-off events. [2025-04-13 20:47:45,710 INFO L117 PetriNetUnfolderBase]: For 1104551/1104551 co-relation queries the response was YES. [2025-04-13 20:47:47,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431675 conditions, 37051 events. 25226/37051 cut-off events. For 1104551/1104551 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 253549 event pairs, 1218 based on Foata normal form. 4/36328 useless extension candidates. Maximal degree in co-relation 431365. Up to 33141 conditions per place. [2025-04-13 20:47:47,999 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 4843 selfloop transitions, 1190 changer transitions 7/6040 dead transitions. [2025-04-13 20:47:47,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1163 places, 6040 transitions, 144570 flow [2025-04-13 20:47:47,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 20:47:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 20:47:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 597 transitions. [2025-04-13 20:47:48,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30584016393442626 [2025-04-13 20:47:48,000 INFO L175 Difference]: Start difference. First operand has 1104 places, 5507 transitions, 121353 flow. Second operand 61 states and 597 transitions. [2025-04-13 20:47:48,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1163 places, 6040 transitions, 144570 flow [2025-04-13 20:48:23,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1149 places, 6040 transitions, 141963 flow, removed 1121 selfloop flow, removed 14 redundant places. [2025-04-13 20:48:23,875 INFO L231 Difference]: Finished difference. Result has 1171 places, 5853 transitions, 131544 flow [2025-04-13 20:48:23,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118810, PETRI_DIFFERENCE_MINUEND_PLACES=1089, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=889, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=131544, PETRI_PLACES=1171, PETRI_TRANSITIONS=5853} [2025-04-13 20:48:23,878 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1140 predicate places. [2025-04-13 20:48:23,879 INFO L485 AbstractCegarLoop]: Abstraction has has 1171 places, 5853 transitions, 131544 flow [2025-04-13 20:48:23,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.923076923076923) internal successors, (192), 39 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:23,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:23,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:23,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:48:24,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:24,080 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-13 20:48:24,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -780748965, now seen corresponding path program 3 times [2025-04-13 20:48:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:24,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104634792] [2025-04-13 20:48:24,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:48:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:24,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:24,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:24,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:48:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:24,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104634792] [2025-04-13 20:48:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104634792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:24,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321662849] [2025-04-13 20:48:24,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:48:24,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:24,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:24,720 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-13 20:48:24,720 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-13 20:48:24,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:24,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:24,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:48:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:24,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:48:24,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:24,821 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-13 20:48:25,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:48:25,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:25,422 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 157 treesize of output 85 [2025-04-13 20:48:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:25,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:30,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 202 treesize of output 176 [2025-04-13 20:48:30,168 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:30,169 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 274 treesize of output 224 [2025-04-13 20:48:30,312 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 374 treesize of output 332 [2025-04-13 20:48:30,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:30,319 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 486 treesize of output 404 [2025-04-13 20:48:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:48:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321662849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:30,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 40 [2025-04-13 20:48:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466965199] [2025-04-13 20:48:30,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:30,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 20:48:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 20:48:30,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 20:48:30,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:48:30,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1171 places, 5853 transitions, 131544 flow. Second operand has 42 states, 42 states have (on average 4.761904761904762) internal successors, (200), 42 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:30,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:30,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:48:30,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:18,223 INFO L116 PetriNetUnfolderBase]: 26523/38989 cut-off events. [2025-04-13 20:49:18,224 INFO L117 PetriNetUnfolderBase]: For 1201023/1201023 co-relation queries the response was YES. [2025-04-13 20:49:20,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462315 conditions, 38989 events. 26523/38989 cut-off events. For 1201023/1201023 co-relation queries the response was YES. Maximal size of possible extension queue 2048. Compared 269053 event pairs, 1232 based on Foata normal form. 4/38214 useless extension candidates. Maximal degree in co-relation 461982. Up to 32660 conditions per place. [2025-04-13 20:49:20,608 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 4353 selfloop transitions, 2210 changer transitions 10/6573 dead transitions. [2025-04-13 20:49:20,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1232 places, 6573 transitions, 160470 flow [2025-04-13 20:49:20,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 20:49:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 20:49:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 617 transitions. [2025-04-13 20:49:20,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31098790322580644 [2025-04-13 20:49:20,609 INFO L175 Difference]: Start difference. First operand has 1171 places, 5853 transitions, 131544 flow. Second operand 62 states and 617 transitions. [2025-04-13 20:49:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1232 places, 6573 transitions, 160470 flow [2025-04-13 20:50:00,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1218 places, 6573 transitions, 155706 flow, removed 2189 selfloop flow, removed 14 redundant places. [2025-04-13 20:50:00,775 INFO L231 Difference]: Finished difference. Result has 1240 places, 6352 transitions, 146570 flow [2025-04-13 20:50:00,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=126840, PETRI_DIFFERENCE_MINUEND_PLACES=1157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1754, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=146570, PETRI_PLACES=1240, PETRI_TRANSITIONS=6352} [2025-04-13 20:50:00,778 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1209 predicate places. [2025-04-13 20:50:00,778 INFO L485 AbstractCegarLoop]: Abstraction has has 1240 places, 6352 transitions, 146570 flow [2025-04-13 20:50:00,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.761904761904762) internal successors, (200), 42 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:00,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:00,778 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-13 20:50:00,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:50:00,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:00,979 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-13 20:50:00,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1982564665, now seen corresponding path program 14 times [2025-04-13 20:50:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:00,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003394302] [2025-04-13 20:50:00,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:50:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:00,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:50:00,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:00,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:50:00,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:01,608 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-13 20:50:01,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:01,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003394302] [2025-04-13 20:50:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003394302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:50:01,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222816688] [2025-04-13 20:50:01,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:50:01,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:01,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:50:01,611 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-13 20:50:01,612 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-13 20:50:01,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:50:01,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:01,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:50:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:01,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:50:01,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:50:02,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:02,109 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 152 treesize of output 88 [2025-04-13 20:50:02,604 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-13 20:50:02,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:50:04,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:04,146 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 302 treesize of output 162 [2025-04-13 20:50:04,584 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-13 20:50:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222816688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:50:04,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:50:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 20:50:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866191184] [2025-04-13 20:50:04,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:50:04,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:50:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:04,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:50:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:50:04,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:50:04,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1240 places, 6352 transitions, 146570 flow. Second operand has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:04,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:04,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:50:04,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:50,337 INFO L116 PetriNetUnfolderBase]: 27019/39663 cut-off events. [2025-04-13 20:50:50,337 INFO L117 PetriNetUnfolderBase]: For 1267219/1267219 co-relation queries the response was YES. [2025-04-13 20:50:52,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480067 conditions, 39663 events. 27019/39663 cut-off events. For 1267219/1267219 co-relation queries the response was YES. Maximal size of possible extension queue 2076. Compared 273442 event pairs, 1902 based on Foata normal form. 2/38815 useless extension candidates. Maximal degree in co-relation 479711. Up to 34904 conditions per place. [2025-04-13 20:50:52,673 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 5081 selfloop transitions, 1694 changer transitions 14/6789 dead transitions. [2025-04-13 20:50:52,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1297 places, 6789 transitions, 169146 flow [2025-04-13 20:50:52,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 20:50:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 20:50:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 585 transitions. [2025-04-13 20:50:52,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3098516949152542 [2025-04-13 20:50:52,674 INFO L175 Difference]: Start difference. First operand has 1240 places, 6352 transitions, 146570 flow. Second operand 59 states and 585 transitions. [2025-04-13 20:50:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1297 places, 6789 transitions, 169146 flow [2025-04-13 20:51:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1275 places, 6789 transitions, 166585 flow, removed 1080 selfloop flow, removed 22 redundant places. [2025-04-13 20:51:36,810 INFO L231 Difference]: Finished difference. Result has 1290 places, 6615 transitions, 156577 flow [2025-04-13 20:51:36,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144055, PETRI_DIFFERENCE_MINUEND_PLACES=1217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1476, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=156577, PETRI_PLACES=1290, PETRI_TRANSITIONS=6615} [2025-04-13 20:51:36,813 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1259 predicate places. [2025-04-13 20:51:36,813 INFO L485 AbstractCegarLoop]: Abstraction has has 1290 places, 6615 transitions, 156577 flow [2025-04-13 20:51:36,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:36,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:51:36,814 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-13 20:51:36,821 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-13 20:51:37,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:37,014 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-13 20:51:37,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:51:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1450896457, now seen corresponding path program 15 times [2025-04-13 20:51:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:51:37,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516916317] [2025-04-13 20:51:37,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:51:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:51:37,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:37,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:37,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:51:37,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:38,025 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-13 20:51:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:51:38,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516916317] [2025-04-13 20:51:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516916317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:51:38,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741330252] [2025-04-13 20:51:38,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:51:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:51:38,027 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-13 20:51:38,028 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-13 20:51:38,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:38,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:38,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:51:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:38,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:51:38,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:51:38,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:51:38,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:51:38,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:38,699 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 180 treesize of output 88 [2025-04-13 20:51:39,071 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-13 20:51:39,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:51:40,650 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:40,650 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 330 treesize of output 174 [2025-04-13 20:51:41,108 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-13 20:51:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741330252] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:51:41,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:51:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 20:51:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014068116] [2025-04-13 20:51:41,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:51:41,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:51:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:51:41,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:51:41,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:51:41,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:51:41,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1290 places, 6615 transitions, 156577 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-13 20:51:41,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:51:41,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:51:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:51:43,382 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-13 20:51:43,382 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:51:43,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:51:43,397 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:51:43,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-13 20:51:43,600 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,SelfDestructingSolverStorable44 [2025-04-13 20:51:43,600 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (33states, 3/32 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 5258 conditions, 430 events (222/429 cut-off events. For 16236/16236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 3084 event pairs, 8 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 4891. Up to 120 conditions per place.). [2025-04-13 20:51:43,606 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:51:43,606 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:51:43,606 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:51:43,607 INFO L422 BasicCegarLoop]: Path program histogram: [17, 15, 5, 3, 1, 1, 1, 1, 1] [2025-04-13 20:51:43,613 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:51:43,613 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:51:43,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:51:43 BasicIcfg [2025-04-13 20:51:43,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:51:43,618 INFO L158 Benchmark]: Toolchain (without parser) took 776636.42ms. Allocated memory was 125.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 86.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-04-13 20:51:43,619 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:51:43,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.97ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 71.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:51:43,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.87ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 69.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:51:43,620 INFO L158 Benchmark]: Boogie Preprocessor took 33.48ms. Allocated memory is still 125.8MB. Free memory was 69.0MB in the beginning and 67.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:51:43,621 INFO L158 Benchmark]: RCFGBuilder took 474.12ms. Allocated memory is still 125.8MB. Free memory was 67.2MB in the beginning and 21.1MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 20:51:43,621 INFO L158 Benchmark]: TraceAbstraction took 775837.92ms. Allocated memory was 125.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 20.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-04-13 20:51:43,622 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.17ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.97ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 71.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.87ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 69.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.48ms. Allocated memory is still 125.8MB. Free memory was 69.0MB in the beginning and 67.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 474.12ms. Allocated memory is still 125.8MB. Free memory was 67.2MB in the beginning and 21.1MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 775837.92ms. Allocated memory was 125.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 20.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.4GB. 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (33states, 3/32 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 5258 conditions, 430 events (222/429 cut-off events. For 16236/16236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 3084 event pairs, 8 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 4891. Up to 120 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (33states, 3/32 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 5258 conditions, 430 events (222/429 cut-off events. For 16236/16236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 3084 event pairs, 8 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 4891. Up to 120 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (33states, 3/32 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 5258 conditions, 430 events (222/429 cut-off events. For 16236/16236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 3084 event pairs, 8 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 4891. Up to 120 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (33states, 3/32 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 5258 conditions, 430 events (222/429 cut-off events. For 16236/16236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 3084 event pairs, 8 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 4891. Up to 120 conditions per place.). - 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.7s, OverallIterations: 45, TraceHistogramMax: 2, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 680.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8385 SdHoareTripleChecker+Valid, 43.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8385 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1761 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65726 IncrementalHoareTripleChecker+Invalid, 67487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1761 mSolverCounterUnsat, 0 mSDtfsCounter, 65726 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2683 GetRequests, 894 SyntacticMatches, 44 SemanticMatches, 1745 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34245 ImplicationChecksByTransitivity, 109.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156577occurred in iteration=44, InterpolantAutomatonStates: 1325, 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.8s SatisfiabilityAnalysisTime, 87.1s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1695 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 2313 ConstructedInterpolants, 0 QuantifiedInterpolants, 131454 SizeOfPredicates, 364 NumberOfNonLiveVariables, 5502 ConjunctsInSsa, 724 ConjunctsInUnsatCore, 105 InterpolantComputations, 18 PerfectInterpolantSequences, 171/372 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